Understanding complex datasets: Data mining with matrix decompositions

Understanding Complex Datasets: Data Mining with Matrix Decompositions

Volumn , Issue , 2007, Pages 1-237

  Skillicorn, David ^a  

^a QUEEN S UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 74049123312     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/9781584888338     Document Type: Book

References (119)

1. E. Acar, C.A. Bingöl, H. Bingöl, and B. Yener. Computational analysis of epileptic focus localization. In Proceedings of the 24th IASTED International Multi-Conference, Biomedical Engineering, February 2006.
2. E. Acar, S.A. Çamtepe, M.S. Krishnamoorthy, and B. Yener. Modelling and multiway analysis of chatroom tensors. In IEEE International Conference on Intelligence and Security Informatics (ISI 2005), pages 256–268. Springer LNCS 3495, 2005.
3. E. Acar, S.A. Çamtepe, and B. Yener. Collective sampling and analysis of high order tensors for chatroom communication. In IEEE International Conference on Intelligence and Security Informatics (ISI2006), pages 213–224. Springer LNCS 3975, 2006.
4. D. Achlioptas and F. McSherry. Fast computation of low rank matrix approximations. In STOC: ACM Symposium on Theory of Computing (STOC), 2001.
5. R. Agrawal, T. Imielinski, and A.N. Swami. Mining association rules between sets of items in large databases. In P. Buneman and S. Jajodia, editors, Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, pages 207–216, Washington, D.C., 1993.
6. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In J.B. Bocca, M. Jarke, and C. Zaniolo, editors, Proceedings of the 20th International Conference on Very Large Data Bases, VLDB, pages 487–499. Morgan Kaufmann, 1994.
7. C.J. Alpert and S.-Z. Yao. Spectral partitioning: The more eigenvectors, the better. In 32nd ACM/IEEE Design Automation Conference, pages 195–200, June 1995.
8. O. Alter, P.O. Brown, and D. Botstein. Singular value decomposition for genome-wide expression data processing and modeling. Proceedings of the National Academy of Science, 97(18):10101–10106, 2000.
9. C. A. Andersson and R. Bro. The N-way toolbox for MATLAB. Chemometrics and Intelligent Laboratory Systems, 52(1):1–4, 2000.
10. F.R. Bach and M.I. Jordan. Finding clusters in Independent Component Analysis. Technical Report UCB/CSD-02-1209, Computer Science Division, University of California, Berkeley, 2002.
11. B.W. Bader and T.G. Kolda. MATLAB tensor classes for fast algorithm prototyping. Technical Report SAND2004-5187, Sandia National Laboratories, October 2004.
12. M. Belkin and P. Niyogi. Laplacian eigenmaps and spectral techniques for embedding and clustering. In T. G. Dietterich, S. Becker, and Z. Ghahramani, editors, Advances in Neural Information Processing Systems 14, Cambridge, MA, 2002. MIT Press.
13. M.W. Berry, S.T. Dumais, and G.W. O’Brien. Using linear algebra for intelligent information retrieval. SIAM Review, 37(4):573–595, 1995.
14. D.L. Boley. Principal direction divisive partitioning. Data Mining and Knowledge Discovery, 2(4):325–344, 1998.
15. B.E. Boser, I.M. Guyon, and V.N. Vapnik. A training algorithm for optimal margin classifiers. In D. Haussler, editor, 5th Annual ACM Workshop on COLT, pages 144–152, Pittsburgh, 1992.
16. M. Brand. A random walks perspective on maximizing satisfaction and profit. In SIAM International Conference on Data Mining, pages 12–19, 2005.
17. L. Breiman. Random forests–random features. Technical Report 567, Department of Statistics, University of California, Berkeley, September 1999.
18. L. Breiman, J.H. Friedman, R.A. Olshen, and C.J. Stone. Classification and Regression Trees. Chapman and Hall, New York, 1984.
19. S. Brin and L. Page. The Anatomy of a Large Scale Hypertextual Web Search Engine. In Proceedings of the Seventh International Conference of the World Wide Web 7, pages 107–117, Brisbane, Australia, 1998.
20. S. Brin, L. Page, R. Motwani, and T.Winograd. The PageRank Citation Ranking: Bringing Order to the Web. Stanford Digital Libraries Working Paper, 1998.
21. K. Bryan and T. Leise. The $25,000,000,000 eigenvector: The linear algebra behind Google. SIAM Review, 48(3):569–581, 2006.
22. C.J.C. Burges. A tutorial on support vector machines for pattern recognition. Data Mining and Knowledge Discovery, 2:121–167, 1998.
23. P. Carmona-Saez, R.D. Pascual-Marqui, F. Tirado, J.M. Carazo, and A. Pascual-Montano. Biclustering of gene expression data by non-smooth non-negative matrix factorization. BMC Bioinformatics, 7(78), February 2006.
24. J.D. Carroll and J.-J. Chang. Analysis of individual differences in multidimensional scaling via an N-way generalization of “Eckart-Young” decomposition. Psychometrika, 35:283–319, 1970.
25. M.T. Chu. On the statistical meaning of truncated singular value decomposition. Preprint, 2001.
26. M.T. Chu, R.E. Funderlic, and G.H. Golub. A rank-one reduction formula and its applications to matrix factorizations. SIAM Review, 37:512–530, 1995.
27. F.R.K. Chung. Spectral Graph Theory. Number 92 in CBMS Regional Conference Series in Mathematics. American Mathematical Society, 1997.
28. F.R.K. Chung. Lectures on spectral graph theory. www.math.ucsd.edu/∼fan/research/revised.html, 2006.
29. D.R. Cohen, D.B. Skillicorn, S.Gatehouse, and I. Dalrymple. Signature detection in geochemical data using singular value decomposition and semi-discrete decomposition. In 21st International Geochemical Exploration Symposium (IGES), Dublin, August 2003.
30. C. Cortes and V. Vapnik. Support-vector networks. Machine Learning, 20, 1995.
31. N. Cristianini and J. Shawe-Taylor. An Introduction to Support Vector Machines and other kernel-based learning methods. Cambridge University Press, 2000.
32. S. C. Deerwester, S. T. Dumais, T. K. Landauer, G. W. Furnas, and R. A. Harshman. Indexing by latent semantic analysis. Journal of the American Society of Information Science, 41(6):391–407, 1990.
33. A.P. Dempster, N.M. Laird, and D.B. Rubin. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, Series B, 39:138, 1977.
34. I.S. Dhillon and S. Sra. Generalized nonnegative matrix approximations with Bregman divergences. Technical report, University of Texas at Austin Department of Computer Sciences, 2005.
35. C.H.Q. Ding, X. He, and H. Zha. A spectral method to separate disconnected and nearly-disconnected Web graph components. In KDD 2001, pages 275–280, 2001.
36. D. Donoho and V. Stodden. When does non-negative matrix factorization give a correct decomposition in parts? In Advances in Neural Information Processing Systems (NIPS) 17, 2004.
37. H. Drucker, C.J.C. Burges, L. Kaufman, A. Smola, and V. Vapnik. Support vector regression machines. In Advances in Neural Information Processing Systems 9, NIPS, pages 155–161, 1996.
38. S.T. Dumais, T.A. Letsche, M.L. Littman, and T.K. Landauer. Automatic cross-language retrieval using Latent Semantic Indexing. In AAAI-97 Spring Symposium Series: Cross-Language Text and Speech Retrieval, pages 18–24, 1997.
39. M. Dunham. Data Mining Introductory and Advanced Topics. Prentice Hall, 2003.
40. D.M. Dunlavy, T.G. Kolda, and W.P. Kegelmeyer. Multilinear algebra for analyzing data with multiple linkages. Technical Report SAND2006-2079, Sandia National Laboratories, April 2006.
41. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In 2nd International Conference on Knowledge Discovery and Data Mining (KDD’96), Portland, Oregon, 1996. AAAI Press.
42. European Parliament Temporary Committee on the ECHELON Interception System. Final report on the existence of a global system for the interception of private and commercial communications (ECHELON interception system), 2001.
43. F. Fouss, A. Pirotte, J.-M. Renders, and M. Saerens. Random-walk computation of similarities between nodes of a graph, with application to collaborative recommendation. IEEE Transactions on Knowledge and Data Engineering, 2006.
44. J. Friedman and N. Fisher. Bump hunting on high-dimensional data. Statistics and Computation, 1997.
45. A. Frieze, R. Kannan, and S. Vempala. Fast Monte-Carlo algorithms for finding low-rank approximations. In FOCS ’98, pages 370–378, 1998.
46. M. Funaro, E. Oja, and H. Valpola. Artefact detection in astrophysical image data using independent component analysis. In Proceedings 3rd International Workshop on Independent Component Analysis and Blind Source Separation, pages 43–48, December 2001.
47. M. Gladwell. The science of the sleeper. The New Yorker, pages 48–54, October 4, 1999.
48. G.H. Golub and C.F. van Loan. Matrix Computations. Johns Hopkins University Press, 3rd edition, 1996.
49. S.M. Hamilton. Electrochemical mass transport in overburden: A new model to account for the formation of selective leach geochemical anomalies in glacial terrain. Journal of Geochemical Exploration, pages 155– 172, 1998.
50. D.J. Hand, H. Mannila, and P. Smyth. Principles of Data Mining. MIT Press, 2000.
51. R.A. Harshman. Foundations of the PARAFAC procedure: Models and conditions for an “explanatory” multi-modal factor analysis. UCLA Working Papers in Phonetics, 16, 1970.
52. B. Hendrickson. Latent Semantic Analysis and Fiedler retrieval. Linear Algebra and Applications, 421:345–355, 2007.
53. S. Hochreiter and J. Schmidhuber. LOCOCODE versus PCA and ICA. In Proceedings ICANN’98, pages 669–674, 1998.
54. S. Hochreiter and J. Schmidhuber. Feature extraction through LO-COCODE. Neural Computation, 11(3):679–714, 1999.
55. S. Hochreiter and J. Schmidhuber. Lococode performs nonlinear ICA without knowing the number of sources. In Proceedings of the ICA’99, pages 149–154, 1999.
56. P.O. Hoyer. Non-negative matrix factorization with sparseness constraints. Journal of Machine Learning, 5:1457–1469, 2004.
57. L. Hubert, J. Meulman, and W. Heiser. Two purposes for matrix factorization: A historical appraisal. SIAM Review, 42(1):68–82, 2000.
58. A. Hyvärinen. Survey on independent component analysis. Neural Computing Surveys, 2:94–128, 1999.
59. A. Hyvarïnen, J. Karhunen, and E. Oja. Independent Component Analysis. John Wiley, 2001.
60. A. Hyvärinen and E. Oja. Independent component analysis: Algorithms and applications. Neural Networks, 13(4–5):411–430, 2000.
61. S.C. Johnson. Hierarchical clustering schemes. Psychometrika, 2:241– 254, 1967.
62. M. Juvela, K. Lehtinen, and P. Paatero. The use of positive matrix factorization in the analysis of molecular line spectra from the Thumbprint Nebula. In Proceedings of the Fourth Haystack Conference “Clouds; cores and low mass stars,” Astronomical Society of the Pacific Conference Series, volume 65, pages 176–180, 1994.
63. D. Kalman. A singularly valuable decomposition: The SVD of a matrix. College Math Journal, 27(1), January 1996.
64. M. Kantardzic. Data Mining: Concepts, Models, Methods, and Algorithms. Wiley-IEEE Press, 2002.
65. A. Karol and M.-A. Williams. Understanding human strategies for change: an empirical study. In TARK ’05: Proceedings of the 10th conference on Theoretical aspects of rationality and knowledge, pages 137–149. National University of Singapore, 2005.
66. P.J. Kennedy, S.J. Simoff, D.B. Skillicorn, and D. Catchpoole. Extracting and explaining biological knowledge in microarray data. In Pacific Asia Knowledge Discovery and Data Mining Conference (PAKDD2004), Sydney, May 2004.
67. H.A.L. Kiers. Some procedures for displaying results from three-way methods. Journal of Chemometrics, 14:151–170, 2000.
68. H.A.L. Kiers and A. der Kinderen. A fast method for choosing the numbers of components in Tucker3 analysis. British Journal of Mathematical and Statistical Psychology, 56:119–125, 2003.
69. J.M. Kleinberg. Authoritative sources in a hyperlinked environment. Journal of the ACM, 46(5):604–632, 1999.
70. G. Kolda and D.P. O’Leary. A semi-discrete matrix decomposition for latent semantic indexing in information retrieval. ACM Transactions on Information Systems, 16:322–346, 1998.
71. T.G. Kolda, B.W. Bader, and J.P. Kenny. Higher-order web link analysis using multilinear algebra. In Fifth IEEE International Conference on Data Mining, pages 242–249, November 2005.
72. T.G. Kolda and D.P. O’Leary. Computation and uses of the semidiscrete matrix decomposition. ACM Transactions on Information Processing, 1999.
73. T.G. Kolda and D.P. O’Leary. Latent Semantic Indexing Via A Semi-Discrete Matrix Decomposition, volume 107 of IMA Volumes in Mathematics and Its Applications, pages 73–80. Springer Verlag, 1999.
74. T. Kolenda, L. Hansen, and J. Larsen. Signal detection using ICA: Application to chat room topic spotting. In Proceedings of ICA’2001, December 2001.
75. A. Kontostathis and W.M. Pottenger. Detecting patterns in the LSI term-term matrix. Technical Report LU-CSE-02-010, Department of Computer Science and Engineering, Lehigh University, 2002.
76. A. Kontostathis and W.M. Pottenger. Improving retrieval performance with positive and negative equivalence classes of terms. Technical Report LU-CSE-02-009, Department of Computer Science and Engineering, Lehigh University, 2002.
77. M. Koyutürk and A. Grama. Binary non-orthogonal decomposition: A tool for analyzing binary-attributed datasets. www.cs.purdue.edu/homes/ayg/RECENT/bnd.ps, 2002.
78. D.D. Lee and H.S. Seung. Learning the parts of objects by non-negative matrix factorization. Nature, 401:788–791, 1999.
79. D.D. Lee and H.S. Seung. Algorithms for non-negative matrix factorization. In NIPS, Neural Information Processing Systems, pages 556–562, 2000.
80. M.S. Lewicki and T.J. Sejnowski. Learning overcomplete representations. Neural Computation, 12(2):337–365, 2000.
81. D. Liben-Nowell and J. Kleinberg. The link prediction problem for social networks. In Proceedings of the Twelfth International Conference on Information and Knowledge Management, pages 556–559, 2003.
82. C.-J. Lin. Projected gradient methods for non-negative matrix factorization. Neural Computation, to appear.
83. J.B. MacQueen. Some methods for classification and analysis of multivariate observations. In Proceedings of 5th Berkeley Symposium on Mathematical Statistics and Probability, volume 1, pages 281–297. University of California Press, 1967.
84. V.A.J. Maller. Criminal investigation systems: The growing dependence on advanced computer systems. Computing and Control Engineering Journal, pages 93–100, April 1996.
85. S. McConnell and D.B. Skillicorn. Semidiscrete decomposition: A bump hunting technique. In Australasian Data Mining Workshop, pages 75– 82, December 2002.
86. M. Meilă and J. Shi. A random walks view of spectral segmentation. In AI and Statistics (AISTATS), 2001.
87. B. N. Miller, I. Albert, S. K. Lam, J. A. Konstan, and J. Riedl. Movie-Lens unplugged: Experiences with an occasionally connected recommender system. In IUI’03: Proc. 8th International Conference on Intelligent User Interfaces, pages 263–266, Miami, Florida, USA, 2003. ACM Press.
88. J. C. Nash. Compact Numerical Methods for Computers: Linear Algebra and Function Minimisation. John Wiley & Sons, 1979.
89. A. Y. Ng, A. X. Zheng, and M. I. Jordan. Link analysis, eigenvectors and stability. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI-01), pages 903–910, 2001.
90. D.P. O’Leary and S. Peleg. Digital image compression by outer product expansion. IEEE Transactions on Communications, 31:441–444, 1983.
91. K. Popper. The Logic of Scientific Discovery. Hutchinson, London, 1959.
92. J.R. Quinlan. Induction of decision trees. Machine Learning, 1:81–106, 1986.
93. J.R. Quinlan. C4.5: Programs for Machine Learning. Morgan-Kaufmann, 1993.
94. J.R. Quinlan. Learning efficient classification procedures and their application to chess end games. In Michalski, Carbonell, and Mitchell, editors, Machine learning: An artificial intelligence approach. Morgan Kaufmann, 1993.
95. M. Saerens, F. Fouss, L. Yen, and P. Dupont. The principal component analysis of a graph and its relationships to spectral clustering. In ECML 2004, 2004.
96. B. Sarwar, G. Karypis, J. Konstan, and J. Riedl. Application of dimensionality reduction in recommender systems – A case study. In ACM WebKDD Workshop, 2000.
97. F. Shahnaz, M.W. Berry, V.P. Pauca, and R.J. Plemmons. Document clustering using Nonnegative Matrix Factorization. Journal on Information Processing and Management, 42(2):373–386, March 2006.
98. A. Shashua and T. Hazan. Non-negative tensor factorization with applications to statistics and computer vision. In Proceedings of the 22nd International Conference on Machine Learning, 2005.
99. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8):888– 905, 2000.
100. D.B. Skillicorn. Clusters within clusters: SVD and counterterrorism. In First Workshop on Data Mining for Counter Terrorism and Security, 2003 SIAM Data Mining Conference, March 2003.
101. D.B. Skillicorn. Beyond keyword filtering for message and conversation detection. In IEEE International Conference on Intelligence and Security Informatics (ISI2005), pages 231–243. Springer-Verlag Lecture Notes in Computer Science LNCS 3495, May 2005.
102. D.B. Skillicorn and C. Robinson. A data-driven protein-structure prediction algorithm. Technical Report 2006-509, Queen’s University, School of Computing, 2006.
103. D.B. Skillicorn and N. Vats. The Athens system for novel information discovery. Technical Report 2004-489, Queen’s University School of Computing Technical Report, October 2004.
104. D.B. Skillicorn and N. Vats. Novel information discovery for intelligence and counterterrorism. Decision Support Systems, April 2006.
105. D.B. Skillicorn and X. Yang. High-performance singular value decomposition. In Grossman, Kamath, Kumar, Kegelmeyer, and Namburu, editors, Data Mining for Scientific and Engineering Applications, pages 401–424. Kluwer, 2001.
106. B.W. Smee. A new theory to explain the formation of soil geochemical responses over deeply covered gold mineralisation in arid environments. Journal of Geochemical Exploration, pages 149–172, 1998.
107. B.W. Smee. Theory behind the use of soil pH measurements as an inexpensive guide to buried mineralization, with examples. Explore, 118:1–19, 2003.
108. D. Spielman. Spectral graph theory and its applications. Course Notes: www.cs.yale.edu/homes/spielman/eigs/, 2004.
109. G.W. Stewart. On the early history of the Singular Value Decomposition. Technical Report TR-2855, University of Maryland, Department of Computer Science, March 1992.
110. P.-N. Tan, M. Steinbach, and V. Kumar. Introduction to Data Mining. Pearson Addison-Wesley, 2005.
111. L.R. Tucker. Some mathematical notes on three-mode factor analysis. Psychometrika, 31:279–311, 1966.
112. What is Holmes 2. www.holmes2.com/holmes2/whatish2/, 2004.
113. N. Vats and D.B. Skillicorn. Information discovery within organizations using the Athens system. In Proceedings of 14th Annual IBM Centers for Advanced Studies Conference (CASCON 2004), October 2004.
114. U. von Luxburg. A tutorial on spectral clustering. Technical Report 149, Max Plank Institute for Biological Cybernetics, August 2006.
115. U. von Luxburg, O. Bousquet, and M. Belkin. Limits of spectral clustering. In Advances in Neural Information Processing Systems (NIPS) 17, volume 17, pages 857–864, Cambridge, MA, 2005. MIT Press.
116. P. Wong, S. Choi, and Y. Niu. A comparison of PCA/ICA for data preprocessing in a geoscience application. In Proceedings of ICA, pages 278–283, December 2001.
117. L. Zelnik-Manor and P. Perona. Self-tuning spectral clustering. In Advances in Neural Information Processing Systems 16, Cambridge, MA, 2004. MIT Press.
118. M. Zhu and A. Ghodsi. Automatic dimensionality selection from the scree plot via the use of profile likelihood. Computational Statistics and Data Analysis, 51(2):918–930, 2006.
119. S. Zyto, A. Grama, and W. Szpankowski. Semi-discrete matrix transforms (SDD) for image and video compression. Technical report, Department of Computer Science, Purdue University, 2000.