Fetching the paper…
Reading the bibliography…
In applications such as social, energy, transportation, sensor, and neuronal networks, high-dimensional data naturally reside on the vertices of weighted graphs.
B. Aspvall and J. R. Gilbert, “Graph coloring using eigenvalue decomposition,” SIAM J. Alg. Disc. Meth. , vol. 5, no. 4, pp. 526–538, 1984
1984
Earlier work this paper cites.
R. A. Horn and C. R. Johnson, Matrix Analysis . Cambridge University Press, 1990
1990
Earlier work this paper cites.
D. J. Klein and M. Randić, “Resistance distance,” J. Math. Chem. , vol. 12, pp. 81–95, 1993
1993
Earlier work this paper cites.
D. L. Donoho, “Unconditional bases are optimal bases for data compression and for statistical estimation,” Appl. Comput. Harmon. Anal. , vol. 1, no. 1, pp. 100–115, Dec. 1993
1993
Earlier work this paper cites.
C. Apté, F. Damerau, and S. Weiss, “Automated learning of decision rules for text categorization,” ACM Trans. Inf. Syst. , vol. 12, no. 3, pp. 233–251, 1994
1994
Earlier work this paper cites.
S. T. Barnard and H. D. Simon, “Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems,” Concurrency: Practice and Experience , vol. 6, no. 2, pp. 101–117, Apr. 1994
1994
Earlier work this paper cites.
M. Vetterli and J. Kovačević, Wavelets and Subband Coding . Prentice-Hall, 1995
1995
Earlier work this paper cites.
F. K. Chung, Spectral Graph Theory . Vol. 92 of the CBMS Regional Conference Series in Mathematics, AMS Bokstore, 1997
1997
Earlier work this paper cites.
W. Sweldens, “The lifting scheme: A construction of second generation wavelets,” SIAM J. Math. Anal. , vol. 29, no. 2, pp. 511–546, 1998
1998
Earlier work this paper cites.
D. Lowe, “Object recognition from local scale-invariant features,” in Proc. IEEE Int. Conf. Computer Vision , vol. 2, 1999, pp. 1150–1157
1999
Earlier work this paper cites.
I. Guskov, W. Sweldens, and P. Schroder, “Multiresolution signal processing for meshes,” in Proc. ACM SIG-GRAPH Conf. , Los Angeles, CA, Aug. 1999, pp. 325–334
1999
Earlier work this paper cites.
G. Taubin, “Geometric signal processing on polygonal meshes,” Eurographics State of the Art Report , Aug. 2000
2000
Earlier work this paper cites.
Z. Karni and C. Gotsman, “Spectral compression of mesh geometry,” in Proc. ACM SIG-GRAPH Conf. , New Orleans, LA, Jul. 2000, pp. 279–286
2000
Earlier work this paper cites.
S. Osher and J. Shen, “Digitized PDE method for data restoration,” in Handbook of Analytic-Computational Methods in Applied Mathematics , G. Anastassiou, Ed. Chapman and Hall / CRC Press, 2000, pp. 751–771
2000
Earlier work this paper cites.
C. Godsil and G. F. Royle, Algebraic Graph Theory . Springer, 2001
2001
Earlier work this paper cites.
A. J. Smola and R. Kondor, “Kernels and regularization on graphs,” in Proc. Ann. Conf. Comp. Learn. Theory , ser. Lect. Notes Comp. Sci., B. Schölkopf and M. Warmuth, Eds. Springer, 2003, pp. 144–158
2003
Earlier work this paper cites.
X. Zhu and Z. Ghahramani, “Semi-supervised learning using Gaussian fields and harmonic functions,” in Proc. Int. Conf. Mach. Learn. , Washington, D.C., Aug. 2003, pp. 912–919
2003
Earlier work this paper cites.
M. Crovella and E. Kolaczyk, “Graph wavelets for spatial traffic analysis,” in Proc. IEEE INFOCOM , vol. 3, Mar. 2003, pp. 1848–1857
2003
Earlier work this paper cites.
D. Zhou and B. Schölkopf, “A regularization framework for learning from graph data,” in Proc. ICML Workshop Stat. Relat. Learn. and Its Connections to Other Fields , Jul. 2004, pp. 132–137
2004
Earlier work this paper cites.
M. Belkin, I. Matveeva, and P. Niyogi, “Regularization and semi-supervised learning on large graphs,” in Learn. Theory , ser. Lect. Notes Comp. Sci. Springer-Verlag, 2004, pp. 624–638
2004
Earlier work this paper cites.
D. Zhou, O. Bousquet, T. N. Lal, J. Weston, and B. Schölkopf, “Learning with local and global consistency,” in Adv. Neural Inf. Process. Syst. , S. Thrun, L. Saul, and B. Schölkopf, Eds., vol. 16. MIT Press, 2004, pp. 321–328
2004
Earlier work this paper cites.
——, “Regularization on discrete spaces,” in Pattern Recogn. , ser. Lect. Notes Comp. Sci., W. G. Kropatsch, R. Sablatnig, and A. Hanbury, Eds. Springer, 2005, vol. 3663, pp. 361–368
2005
Earlier work this paper cites.
M. Hein, J.-Y. Audibert, and U. von Luxburg, “From graphs to manifolds Ð- Weak and strong pointwise consistency of graph Laplacians,” in Learning Theory , ser. Lecture Notes in Comput. Sci., P. Auer and R. Meir, Eds. Springer Berlin / Heidelberg, 2005, vol. 3559, pp. 470–485
2005
Cited alongside, same era.
A. Buades, B. Coll, and J. Morel, “A review of image denoising algorithms, with a new one,” SIAM J. Multiscale Model. Simul. , vol. 4, no. 2, pp. 490–530, 2005
2005
Cited alongside, same era.
R. R. Coifman, S. Lafon, A. B. Lee, M. Maggioni, B. Nadler, F. Warner, and S. W. Zucker, “Geometric diffusions as a tool for harmonic analysis and structure definition of data: Diffusion maps,” Proc. Natl. Acad. Sci. , vol. 102, no. 21, pp. 7426–7431, May 2005
2005
Cited alongside, same era.
M. Maggioni, J. C. Bremer, R. R. Coifman, and A. D. Szlam, “Biorthogonal diffusion wavelets for multiscale representations on manifolds and graphs,” in Proc. SPIE Wavelet XI , vol. 5914, Sep. 2005
2005
I. Pesenson, “Sampling in Paley-Wiener spaces on combinatorial graphs,” Trans. Amer. Math. Soc , vol. 360, no. 10, pp. 5603–5627, 2008
2008
Later among the works it cites.
S. K. Narang and A. Ortega, “Lifting based wavelet transforms on graphs,” in Proc. APSIPA ASC , Sapporo, Japan, Oct. 2009, pp. 441–444
2009
Later among the works it cites.
M. Jansen, G. P. Nason, and B. W. Silverman, “Multiscale methods for data on graphs and irregular multidimensional situations,” J. R. Stat. Soc. Ser. B Stat. Methodol. , vol. 71, no. 1, pp. 97–125, 2009
2009
Later among the works it cites.
R. Rubinstein, A. M. Bruckstein, and M. Elad, “Dictionaries for sparse representation modeling,” Proc. IEEE , vol. 98, no. 6, pp. 1045–1057, Jun. 2010
2010
Later among the works it cites.
L. J. Grady and J. R. Polimeni, Discrete Calculus . Springer, 2010
2010
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
A. D. Szlam, M. Maggioni, R. R. Coifman, and J. C. Bremer, Jr., “Diffusion-driven multiscale analysis on manifolds and graphs: top-down and bottom-up constructions,” in Proc. SPIE Wavelets , vol. 5914, Aug. 2005, pp. 445–455
2005
Cited alongside, same era.
F. Chung, “Laplacians and the Cheeger inequality for directed graphs,” Annals of Combinatorics , vol. 9, no. 1, pp. 1–19, 2005
2005
Cited alongside, same era.
S. Hoory, N. Linial, and A. Wigderson, “Expander graphs and their applications,” Bullet. Amer. Math. Soc. , vol. 43, pp. 439–561, Oct. 2006
2006
Cited alongside, same era.
R. R. Coifman and M. Maggioni, “Diffusion wavelets,” Appl. Comput. Harmon. Anal. , vol. 21, no. 1, pp. 53–94, 2006
2006
Cited alongside, same era.
A. Singer, “From graph to manifold Laplacian: The convergence rate,” Appl. Comput. Harmon. Anal. , vol. 21, no. 1, pp. 128–134, Jul. 2006
2006
Cited alongside, same era.
J. C. Bremer, R. R. Coifman, M. Maggioni, and A. D. Szlam, “Diffusion wavelet packets,” Appl. Comput. Harmon. Anal. , vol. 21, no. 1, pp. 95–112, 2006
2006
Cited alongside, same era.
S. Lafon and A. B. Lee, “Diffusion maps and coarse-graining: A unified framework for dimensionality reduction, graph partitioning, and data set parameterization,” IEEE Trans. Pattern Anal. Mach. Intell. , vol. 28, no. 9, pp. 1393–1403, Sep. 2006
2006
Cited alongside, same era.
W. Wang and K. Ramchandran, “Random multiresolution representations for arbitrary sensor network graphs,” in Proc. IEEE Int. Conf. Acc., Speech, and Signal Process. , vol. 4, May 2006, pp. 161–164
2006
Cited alongside, same era.
Later among the works it cites.
D. Ting, L. Huang, and M. I. Jordan, “An analysis of the convergence of graph Laplacians,” in Proc. Int. Conf. Mach. Learn. , Haifa, Israel, Jun. 2010, pp. 1079–1086
2010
Later among the works it cites.
M. Gavish, B. Nadler, and R. R. Coifman, “Multiscale wavelets on trees, graphs and high dimensional data: Theory and applications to semi supervised learning,” in Proc. Int. Conf. Mach. Learn. , Haifa, Israel, Jun. 2010, pp. 367–374
2010
Later among the works it cites.
S. K. Narang and A. Ortega, “Local two-channel critically sampled filter-banks on graphs,” in Proc. Int. Conf. Image Process. , Hong Kong, Sep. 2010, pp. 333–336
2010
Later among the works it cites.
G. Shen and A. Ortega, “Transform-based distributed data gathering,” IEEE. Trans. Signal Process. , vol. 58, no. 7, pp. 3802–3815, Jul. 2010
2010
Later among the works it cites.
D. Cvetković and I. Gutman, “Selected topics on applications of graph spectra,” Zbornik radova , vol. 14 (22), 2011
2011
Later among the works it cites.
D. I Shuman, P. Vandergheynst, and P. Frossard, “Chebyshev polynomial approximation for distributed signal processing,” in Proc. Int. Conf. Distr. Comput. in Sensor Syst. , Barcelona, Spain, June 2011
2011
Later among the works it cites.
D. K. Hammond, P. Vandergheynst, and R. Gribonval, “Wavelets on graphs via spectral graph theory,” Appl. Comput. Harmon. Anal. , vol. 30, no. 2, pp. 129–150, Mar. 2011
2011
Later among the works it cites.
D. Ron, I. Safro, and A. Brandt, “Relaxation-based coarsening and multiscale graph organization,” Multiscale Model. Simul. , vol. 9, no. 1, pp. 407–423, Sep. 2011
2011
Later among the works it cites.
J. D. Lee and M. Maggioni, “Multiscale analysis of time series of graphs,” in Proc. Int. Conf. Samp. Theory and Appl. , Singapore, May 2011
2011
Later among the works it cites.
S. K. Narang, Y. H. Chao, and A. Ortega, “Graph-wavelet filterbanks for edge-aware image processing,” in Proc. IEEE Stat. Signal Process. Wkshp. , Ann Arbor, MI, Aug. 2012
2012
Closest in time.
D. Spielman, “Spectral graph theory,” in Combinatorial Scientific Computing . Chapman and Hall / CRC Press, 2012
2012
Closest in time.
X. Zhu and M. Rabbat, “Approximating signals supported on graphs,” in Proc. IEEE Int. Conf. Acc., Speech, and Signal Process. , Kyoto, Japan, Mar. 2012
2012
Closest in time.
——, “Graph spectral compressed sensing for sensor networks,” in Proc. IEEE Int. Conf. Acc., Speech, and Signal Process. , Kyoto, Japan, Mar. 2012
2012
Closest in time.
S. K. Narang and A. Ortega, “Perfect reconstruction two-channel wavelet filter-banks for graph structured data,” IEEE. Trans. Signal Process. , vol. 60, pp. 2786–2799, Jun. 2012
2012
Closest in time.
D. I Shuman, B. Ricaud, and P. Vandergheynst, “A windowed graph Fourier tranform,” in Proc. IEEE Stat. Signal Process. Wkshp. , Ann Arbor, MI, Aug. 2012, pp. 133–136
2012
Closest in time.
A. Agaskar and Y. M. Lu, “Uncertainty principles for signals defined on graphs: Bounds and characterizations,” in Proc. IEEE Int. Conf. Acc., Speech, and Signal Process. , Kyoto, Japan, Mar. 2012, pp. 3493–3496
2012
Closest in time.