An Index Structure for Data Mining and Clustering
暂无分享,去创建一个
Kaizhong Zhang | Dennis Shasha | Jason Tsong-Li Wang | Xiong Wang | King-Ip Lin | Bruce A. Shapiro | D. Shasha | J. Wang | Kaizhong Zhang | King-Ip Lin | B. Shapiro | Xiong Wang
[1] Jiong Yang,et al. STING: A Statistical Information Grid Approach to Spatial Data Mining , 1997, VLDB.
[2] Christos Faloutsos,et al. Efficient retrieval of similar time sequences under time warping , 1998, Proceedings 14th International Conference on Data Engineering.
[3] Kaizhong Zhang,et al. Structural matching and discovery in document databases , 1997, SIGMOD '97.
[4] Tian Zhang,et al. BIRCH: an efficient data clustering method for very large databases , 1996, SIGMOD '96.
[5] Hans-Peter Kriegel,et al. A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , 1996, KDD.
[6] Kaizhong Zhang,et al. An Approximate Oracle for Distance in Metric Spaces , 1998, CPM.
[7] Christos Faloutsos,et al. Searching Multimedia Databases by Content , 1996, Advances in Database Systems.
[8] Kaizhong Zhang,et al. Comparing multiple RNA secondary structures using tree comparisons , 1990, Comput. Appl. Biosci..
[9] Aidong Zhang,et al. WaveCluster: A Multi-Resolution Clustering Approach for Very Large Spatial Databases , 1998, VLDB.
[10] W. Nef. Linear Algebra , 1967 .
[11] Peter E. Hart,et al. Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.
[12] R. Ng,et al. Eecient and Eeective Clustering Methods for Spatial Data Mining , 1994 .
[13] Ali S. Hadi,et al. Finding Groups in Data: An Introduction to Chster Analysis , 1991 .
[14] R. Michalski,et al. Learning from Observation: Conceptual Clustering , 1983 .
[15] Anil K. Jain,et al. Algorithms for Clustering Data , 1988 .
[16] Richard O. Duda,et al. Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.
[17] Christos Faloutsos,et al. FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets , 1995, SIGMOD '95.
[18] Dimitrios Gunopulos,et al. Automatic subspace clustering of high dimensional data for data mining applications , 1998, SIGMOD '98.
[19] Gene H. Golub,et al. Matrix computations , 1983 .
[20] Sudipto Guha,et al. CURE: an efficient clustering algorithm for large databases , 1998, SIGMOD '98.
[21] Joseph B. Kruskal,et al. Time Warps, String Edits, and Macromolecules , 1999 .
[22] Laxmi Parida. Pattern Discovery in Biomolecular Data: Tools, Techniques and Applications , 1999 .
[23] Kaizhong Zhang,et al. A System for Approximate Tree Matching , 1994, IEEE Trans. Knowl. Data Eng..
[24] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[25] Shane S. Sturrock,et al. Time Warps, String Edits, and Macromolecules – The Theory and Practice of Sequence Comparison . David Sankoff and Joseph Kruskal. ISBN 1-57586-217-4. Price £13.95 (US$22·95). , 2000 .
[26] Dennis Shasha,et al. New techniques for best-match retrieval , 1990, TOIS.
[27] David W. Lewis,et al. Matrix theory , 1991 .
[28] Jiawei Han,et al. Efficient and Effective Clustering Methods for Spatial Data Mining , 1994, VLDB.