Abstract
My work in data mining started almost immediately after my Ph.D. was completed and was initially unrelated to my Ph.D. thesis, until more recently, when I started working in the field of graph mining. At the time I started working in data mining, the field was still in its infancy. I had graduated in 1996 from MIT in the field of combinatorial optimization and network flows and was mostly interested in problems of a theoretical nature. I had joined IBM Research, which, at the time, contained some of the strongest researchers in the field of data mining, including some of its key founding fathers.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
S. Berchtold, C. Bohm, H.-P. Kriegel, The pyramid-technique: towards breaking the curse of dimensionality, in ACM SIGMOD Conference, 1998
A.K. Jain, R.C. Dubes, Algorithms for Clustering Data (Prentice Hall, Upper Saddle River, NJ, 1988)
C.C. Aggarwal, Re-designing distance functions and distance-based applications for high dimensional data, in ACM SIGMOD Record, March 2001
A. Hinneburg, C.C. Aggarwal, D.A. Keim, What is the nearest neighbor in high dimensional space? in VLDB Conference, 2000
C.C. Aggarwal, P.S. Yu, The IGrid index: reversing the dimensionality curse for similarity indexing in high dimensional space, in ACM KDD Conference, 2000
C.C. Aggarwal, A. Hinneburg, D.A. Keim, On the surprising behavior of distance metrics in high dimensional space, in ICDT Conference, 2010
C.C. Aggarwal, Towards systematic design of distance functions for data mining applications, in ACM KDD Conference, 2003
C.C. Aggarwal, On the effects of dimensionality reduction on high dimensional similarity search, in ACM PODS Conference, 2001
C.C. Aggarwal, P.S. Yu, Finding generalized projected clusters in high dimensional spaces, in ACM SIGMOD Conference, 2000
C.C. Aggarwal, P.S. Yu, Outlier detection for high dimensional data, in ACM SIGMOD Conference, 2001
C.C. Aggarwal, J. Han, J. Wang, P. Yu, A framework for clustering evolving data streams, in VLDB Conference, 2003
C.C. Aggarwal, J. Han, J. Wang, P. Yu, On demand classification of data streams, in ACM KDD Conference, 2004
C.C. Aggarwal, On abnormality detection in spuriously populated data streams, in SDM Conference, 2005
C.C. Aggarwal, On biased reservoir sampling in the presence of stream evolution, in VLDB Conference, 2006
C.C. Aggarwal, Data Streams: Models and Algorithms (Springer, New York, 2007)
C.C. Aggarwal, P.S. Yu, On static and dynamic methods for condensation-based privacy-preserving data mining. ACM Trans. Database Syst. 33(1), 1–39 (2008)
C.C. Aggarwal, P.S. Yu, Privacy-Preserving Data Mining: Models and Algorithms (Springer, New York, 2008)
C.C. Aggarwal, Managing and Mining Uncertain Data (Springer, New York, 2009)
C.C. Aggarwal, Managing and Mining Graph Data (Springer, New York, 2010)
C.C. Aggarwal, Social Network Data Analytics (Springer, New York, 2011)
R. Agrawal, R. Srikant, Privacy-preserving data mining, in ACM SIGMOD Conference, 2000
D. Agrawal, C.C. Aggarwal, On the design and quantification of privacy-preserving data mining algorithms, in ACM PODS Conference, 2001
C.C. Aggarwal, On k-anonymity and the curse of dimensionality, in VLDB Conference, 2005
C.C. Aggarwal, On randomization, public information, and the curse of dimensionality, in ICDE Conference, 2007
C.C. Aggarwal, On the design and quantification of privacy-preserving data mining algorithms, in ICDE Conference, 2009
C.C. Aggarwal, P.S. Yu, A framework for clustering uncertain data streams, in ICDE Conference, 2008
C.C. Aggarwal, P.S. Yu, Outlier detection with uncertain data, in ICDE Conference, 2008
C.C. Aggarwal, On density-based transforms for uncertain data mining, in ICDE Conference, 2007
C.C. Aggarwal, Y. Li, P. Yu, R. Jin, On dense pattern mining in graph streams, in VLDB Conference, 2010
C.C. Aggarwal, Y. Zhao, P. Yu, Outlier detection in graph streams, in ICDE Conference, 2010
C.C. Aggarwal, Y. Li, J. Wang, J. Wang, Frequent pattern mining with uncertain data, in ACM KDD Conference, 2009
R. Agrawal, T. Imielinski, A. Swami, Mining association rules between sets of items in large databases, in SIGMOD Conference, 1993
J.B. Orlin, A polynomial time primal network simplex algorithm for minimum cost flows. Math. Program 77, 109–129 (1997)
R.J. Bayardo Jr., Efficiently mining long patterns from databases, in ACM SIGMOD Conference, 1998
J. Han, J. Pei, Y. Yin, Mining frequent patterns without candidate generation, in ACM SIGMOD Conference, 2000
S. Brin, L. Page, The anatomy of a large scale hypertextual engine, in WWW Conference, 1998
R.K. Ahuja, T.L. Magnanti, J.B. Orlin, Network Flows: Theory, Algorithms and Applications (Prentice Hall, Englewood Cliffs, NJ, 1992)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Aggarwal, C.C. (2012). From Combinatorial Optimization to Data Mining. In: Gaber, M. (eds) Journeys to Data Mining. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28047-4_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-28047-4_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28046-7
Online ISBN: 978-3-642-28047-4
eBook Packages: Computer ScienceComputer Science (R0)