Big data analysis with signal processing on graphs: Representation and processing of massive data sets with irregular structure

IEEE Signal Processing Magazine

Volumn 31, Issue 5, 2014, Pages 80-90

  Sandryhaila, Aliaksei ^a   Moura, Jose M F ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA HANDLING; DATA MINING; GRAPH THEORY; GRAPHIC METHODS; INFORMATION ANALYSIS; METADATA; SIGNAL PROCESSING; TRANSIENTS;

EFFICIENT IMPLEMENTATION; GRAPH FOURIER TRANSFORMS; LARGE AMOUNTS OF DATA; LARGE-SCALE DATA ANALYSIS; LARGE-SCALE DATA PROCESSING; SIGNAL PROCESSING CONCEPTS; SIGNAL PROCESSING ON GRAPHS; SIGNAL PROCESSING THEORY;

BIG DATA;

EID: 85032751426     PISSN: 10535888     EISSN: None     Source Type: Journal    
DOI: 10.1109/MSP.2014.2329213     Document Type: Article

References (45)

1. P. Zikopoulos, D. deRoos, and K. P. Corrigan, Harness the Power of Big Data. New,York: McGraw-Hill, 2012.
2. M. W. Mahoney, M. Maggoni, and P. Drineas, "Tensor-CUR decompositions for tensor-based data," SIAM J. Matrix Anal. Appl., vol. 30, no. 3, pp. 957-987, 2008.
3. T. G. Kolda and B. W. Bader, "Tensor decompositions and applications," SIAM Rev., vol. 51, no. 3, pp. 455-500, 2009.
4. E. Acar and B. Yener, "Unsupervised multiway data analysis: A literature survey," IEEE Trans. Knowledge Data Eng., vol. 21, no. 1, pp. 6-20, 2009.
5. A. H. Andersen and W. S. Rayens, "Structure-seeking multilinear methods for the analysis of fMRI data," Neuroimage, vol. 22, no. 2, pp. 728-739, 2004. (Pubitemid 38759435)
6. F. Miwakeichi, E. Martinez-Montes, P. A. Valdes-Sosa, N. Nishiyama, H. Mizuhara, and Y. Yamaguchi, "Decomposing EEG data into space-time-frequency components using parallel factor analysis," Neuroimage, vol. 22, no. 3, pp. 1035-1045, 2004. (Pubitemid 38829193)
7. N. D. Sidiropoulos, G. B. Giannakis, and R. Bro, "Blind PARAFAC receivers for DSCDMA systems," IEEE Trans. Signal Processing, vol. 48, no. 3, pp. 810-823, 2000. (Pubitemid 30576249)
8. N. D. Sidiropoulos, R. Bro, and G. B. Giannakis, "Parallel factor analysis in sensor array processing," IEEE Trans. Signal Processing, vol. 48, no. 8, pp. 2377-2388, 2000.
9. L. De Lathauwer and J. Castaing, "Blind identification of underdetermined mixtures by simultaneous matrix diagonalization," IEEE Trans. Signal Processing, vol. 56, no. 3, pp. 1096-1105, 2008. (Pubitemid 351386270)
10. J. F. Tenenbaum, V. Silva, and J. C. Langford, "A global geometric framework for nonlinear dimensionality reduction," Science, vol. 290, no. 5500, pp. 2319-2323, 2000. (Pubitemid 32041577)
11. S. Roweis and L. Saul, "Nonlinear dimensionality reduction by locally linear embedding," Science, vol. 290, no. 5500, pp. 2323-2326, 2000. (Pubitemid 32041578)
12. M. Belkin and P. Niyogi, "Laplacian eigenmaps for dimensionality reduction and data representation," Neural Comp., vol. 15, no. 6, pp. 1373-1396, 2003. (Pubitemid 37049796)
13. D. L. Donoho and C. Grimes, "Hessian eigenmaps: Locally linear embedding techniques for high-dimensional data," Proc. Nat. Acad. Sci., vol. 100, no. 10, pp. 5591-5596, 2003. (Pubitemid 36576852)
14. D. K. Hammond, P. Vandergheynst, and R. Gribonval, "Wavelets on graphs via spectral graph theory," J. Appl. Comp. Harm. Anal., vol. 30, no. 2, pp. 129-150, 2011.
15. S. K. Narang and A. Ortega, "Perfect reconstruction two-channel wavelet filter banks for graph structured data," IEEE Trans. Signal Processing, vol. 60, no. 6, pp. 2786-2799, 2012.
16. D. I. Shuman, S. K. Narang, P. Frossard, A. Ortega, and P. Vandergheynst, "The emerging field of signal processing on graphs," IEEE Signal Processing Mag., vol. 30, no. 3, pp. 83-98, 2013.
17. A. Sandryhaila and J. M. F. Moura, "Discrete signal processing on graphs," IEEE Trans. Signal Processing, vol. 61, no. 7, pp. 1644-1656, 2013.
18. A. Sandryhaila and J. M. F. Moura, "Discrete signal processing on graphs: Frequency analysis," IEEE Trans. Signal Processing, vol. 62, no. 12, pp. 3042-3054, 2014.
19. M. Püschel and J. M. F. Moura, "Algebraic signal processing theory: Foundation and 1-D time," IEEE Trans. Signal Processing, vol. 56, no. 8, pp. 3572-3585, 2008.
20. M. Püschel and J. M. F. Moura, "Algebraic signal processing theory: 1-D space," IEEE Trans. Signal Processing, vol. 56, no. 8, pp. 3586-3599, 2008.
21. A. V. Oppenheim, R. W. Schafer, and J. R. Buck, Discrete-Time Signal Processing, 2nd ed. Englewood Cliffs, NJ: Prentice Hall, 1999.
22. P. Lancaster and M. Tismenetsky, The Theory of Matrices, 2nd ed. New York: Academic, 1985.
23. A. Sandryhaila and J. M. F. Moura, "Classification via regularization on graphs," in Proc. IEEE Global Conf. Signal Information Processing, 2013, pp. 495-498.
24. S. Mallat, A Wavelet Tour of Signal Processing, 3rd ed. New York: Academic, 2008.
25. A. Sandryhaila and J. M. F. Moura, "Discrete signal processing on graphs: Graph Fourier transform," in Proc. IEEE Int. Conf. Acoustics, Speech and Signal Processing, 2013, pp. 6167-6170.
26. G. H. Golub and C. F. Van Loan, Matrix Computations, 3rd ed. Baltimore, MD: The Johns Hopkins Univ. Press, 1996.
27. J. W. Cooley and J. W. Tukey, "An algorithm for the machine calculation of complex Fourier series," Math. Computat., vol. 19, no. 9, pp. 297-301, 1965.
28. P. Duhamel and M. Vetterli, "Fast Fourier transforms: A tutorial review and a state of the art," J. Signal Process., vol. 19, no. 4, pp. 259-299, 1990. (Pubitemid 20684988)
29. M. Püschel and J. M. F. Moura, "Algebraic signal processing theory: Cooley-Tukey type algorithms for DCTs and DSTs," IEEE Trans. Signal Processing, vol. 56, no. 4, pp. 1502-1521, 2008. (Pubitemid 351493845)
30. W. Imrich, S. Klavzar, and D. F. Rall, Topics in Graph Theory: Graphs and Their Cartesian Product. Boca Raton, FL: CRC Press, 2008.
31. R. Hammack, W. Imrich, and S. Klavzar, Handbook of Product Graphs, 2nd ed. Boca Raton, FL: CRC Press, 2011.
32. D. E. Dudgeon and R. M. Mersereau, Multidimensional Digital Signal Processing. Englewood Cliffs, NJ: Prentice-Hall, 1983.
33. E. Acar, R. J. Harrison, F. Olken, O. Alter, M. Helal, L. Omberg, B. Bader, A. Kennedy, H. Park, Z. Bai, D. Kim, R. Plemmons, G. Beylkin, T. Kolda, S. Ragnarsson, L. Delathauwer, J. Langou, S. P. Ponnapalli, I. Dhillon, L. Lim, J. R. Ramanujam, C. Ding, M. Mahoney, J. Raynolds, L. Elden, C. Martin, P. Regalia, P. Drineas, M. Mohlenkamp, C. Faloutsos, J. Morton, B. Savas, S. Friedland, L. Mullin, and C. Van Loan, "Future directions in tensor-based computation and modeling," NSF Workshop Rep., Arlington, VA, Feb. 2009.
34. M. Hellmuth, D. Merkle, and M. Middendorf, "Extended shapes for the combinatorial design of RNA sequences," Int. J. Comp. Biol. Drug Des., vol. 2, no. 4, pp. 371-384, 2009.
35. J. Leskovec, D. Chakrabarti, J. Kleinberg, C. Faloutsos, and Z. Ghahramani, "Kronecker graphs: An approach to modeling networks," J. Mach. Learn. Res., vol. 11, pp. 985-1042, Feb. 2010.
36. S. Moreno, S. Kirshner, J. Neville, and S. Vishwanathan, "Tied Kronecker product graph models to capture variance in network populations," in Proc. Allerton Conf. Communication, Control, and Computing, 2010, pp. 1137-1144.
37. S. Moreno, J. Neville, and S. Kirshner, "Learning mixed Kronecker product graph models with simulated method of moments," in Proc. ACM SIGKDD Conf. Knowledge Discovery and Data Mining, 2013, pp. 1052-1060.
38. C. Van Loan and N. Pitsianis, "Approximation with Kronecker products," in Proc. Linear Algebra for Large Scale and Real Time Applications, 1993, pp. 293-314.
39. M. Hellmuth, W. Imrich, and T. Kupka, "Partial star products: A local covering approach for the recognition of approximate Cartesian product graphs," Math. Comp. Sci., vol. 7, no. 3, pp. 255-273, 2013.
40. J. Leskovec and C. Faloutsos, "Scalable modeling of real graphs using Kronecker multiplication," in Proc. Int. Conf. Machine Learning, 2007, pp. 497-504.
41. C. D. Godsil and B. D. McKay, "A new graph product and its spectrum," Bull. Aust. Math. Soc., vol. 18, no. 1, pp. 21-28, 1978.
42. F. Franchetti, M. Püschel, Y. Voronenko, S. Chellappa, and J. M. F. Moura, "Discrete Fourier transform on multicore," IEEE Signal Processing Mag., vol. 26, no. 6, pp. 90-102, 2009.
43. Y. Voronenko, F. de Mesmay, and M. Püschel, "Computer generation of general size linear transform libraries," in Proc. IEEE Int. Symp. Code Generation and Optimization, 2009, pp. 102-113.
44. M. Püschel and J. M. F. Moura, "The algebraic approach to the discrete cosine and sine transforms and their fast algorithms," SIAM J. Comp., vol. 32, no. 5, pp. 1280-1316, 2003.
45. A. Sandryhaila, J. Kovacevic, and M. Püschel, "Algebraic signal processing theory: Cooley-Tukey type algorithms for polynomial transforms based on induction," SIAM J. Matrix Anal. Appl., vol. 32, no. 2, pp. 364-384, 2011.