Gradual clustering algorithms

Proceedings - 7th International Conference on Database Systems for Advanced Applications, DASFAA 2001

Volumn , Issue , 2001, Pages 48-55

  Wu, Fei ^a   Gardarin, G ^a  

^a UNIVERSITY OF VERSAILLES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA MINING; DATABASE SYSTEMS; PROBLEM SOLVING; TREES (MATHEMATICS);

CLUSTERING PROBLEMS; DIMENSIONAL SPACES; DISTANCE CALCULATION; EUCLIDEAN DISTANCE; INCREMENTAL CLUSTERING; N-DIMENSIONAL SPACE; REPRESENTATIVE OBJECT; TRIANGLE INEQUALITY;

CLUSTERING ALGORITHMS;

EID: 84963815805     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DASFAA.2001.916364     Document Type: Conference Paper

References (13)

1. Rakesh Agrawal, Johannes Gehrke, Dimitrios Gunopulos and Prabhakar Raghavan. Automatic Subspace Clustering for High Dimensional Data for Data Mining Application. In Proceedings ACM SIGMOD International Conference on Management of Data, Seattle, Washington, USA, 1998, pp. 94-105.
2. Tolga Bozkaya and Z. Meral Özsoyoglu. Distance-Based Indexing for High-Dimensional Metric Spaces. In Proceedings ACM SIGMOD International Conference on Management of Data, Tucson, Arizona, USA, 1997, pp. 357-368.
3. th International Conference on Very Large DataBases, Santiago de Chile, Chile, 1994, pp. 574-584.
4. rd International Conference on Very Large DataBases, Athens, Greece, 1997, pp. 426-435.
5. nd International Conference on Knowledge Discovery and Data Mining, Portland, OR, 1996, pp. 226-231.
6. Martin Ester, Hans-Peter Kriegel, Jörg Sander, Michael Wimmer and Xiaowei Xu. Incremental Clustering for Mining in a Data Warehousing Environment. In Proceedings of the 24rd International Conference on Very Large Data Bases, New York City, New York, USA, 1998, pp. 323-333.
7. Christos Faloutsos and King-Ip Lin. FastMap: A Fast Algorithm for Indexing, Data-Mining and Visualization of Traditional and Multimedia Datasets. In Proceedings of the ACM SIGMOD International Conference on Management of Data, San Jose, California, 1995, pp. 163-174.
8. Sudipto Guha, Rajeev Rastogi and Kyuseok Shim. CURE: An Efficient Clustering Algorithm for Large Databases. In Proceedings of the ACM SIGMOD International Conference on Management of Data, Seattle, Washington, USA, 1998, pp. 73-84.
9. th International Conference on Data Engineering, Sydney, Australia, 1999.
10. th International Conference on Data Engineering, Sydney, Australia, 1999.
11. Anil K. Jain and Richard C. Dubes. Algorithms for Clustering Data. Prentice Hall, Englewood Cliffs, New Jersey, 1988.
12. rd International Conference on Very Large DataBases, Athens, Greece, 1997, pp. 186-195.
13. Tian Zhang, Raghu Ramakrishnan, Miron Livny. BIRCH: An Efficient Data Clustering Method for Very Large Databases. In Proceedings of the ACM SIGMOD International Conference on Management of Data, Montreal, Quebec, Canada, 1996, pp. 103-114.