Joint cluster analysis of attribute data and relationship data: The Connected k-Center problem

Proceedings of the Sixth SIAM International Conference on Data Mining

Volumn 2006, Issue , 2006, Pages 246-257

  Ester, Martin ^a   Ge, Rong ^a   Gao, Byron J ^a   Hu, Zengjian ^a   Ben Moshe, Boaz ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC LANGUAGES; APPROXIMATION THEORY; DATA MINING; DATABASE SYSTEMS; HEURISTIC METHODS; STATISTICAL METHODS;

APPROXIMATION ALGORITHM; CLUSTER ANALYSIS; COMMUNITY IDENTIFICATION; MARKET SEGMENTATION; SOCIAL NETWORKS;

DATA PROCESSING;

EID: 33745484604     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972764.22     Document Type: Conference Paper

References (27)

1. M. Ankerst, M. M. Breunig, H.-P. Kriegel, and J. Sander. Optics: ordering points to identify the clustering structure. In SIGMOD, 1999.
2. A.-L. Barabási and R. Albert. Emergence of scaling in random networks. Science, 286:509-512, 1999.
3. S. Basu, M. Bilenko, and R. Mooney. A probabilistic framework for semi-supervised clustering. In KDD, 2004.
4. C. S. Bibliography. DBLP. http://www.informatik.unitrier.de/ley/db/index. html. 2005.
5. C. Blake and C. Merz. UCI repository of machine learning databases., 1998.
6. U. Brandes, M. Gaertler, and D. Wagner. Experiments on graph clustering algorithms. In 11th Europ. Symp. Algorithms, pages 568-579, 2003.
7. P. Brucker. On the complexity of clustering problems, in Optimization and Operations Research. Springer-Verlag, 1977.
8. I. Davidson and S. S. Ravi. Clustering with constraints: Feasibility issues and the k-means algorithm. In SDM, 2005.
9. P. Erdos and A. Rényi. On the evolution of random graphs. Publ. Math. Inst. Hungar. Acad. Sci., 5:17-61, 1960.
10. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In KDD, pages 226-231, 1996.
11. S. Guha, R. Rastogi, and K. Shim. Rock: a robust clustering algorithm for categorical attributes. In ICDE, 1999.
12. J. Han and M. Kamber. Data mining: concepts and techniques. Morgan Kaufmann, 2001.
13. R. A. Hanneman and M. Riddle. Introduction to social network methods. http://faculty.ucr.edu/hanneman/, 2005.
14. E. Hartuv and R. Shamir. A clustering algorithm based on graph connectivity. Information Processing Letters, 76:175-181, 2000.
15. D. S. Hochbaum and D. B. Shmoys. A best possible heuristic for the k-center problem. Mathematics of Operations Research, 10:180-184, 1985.
16. D. Iacobucci. Networks in marketing. Sage Publications, 1996.
17. A. Jain and R. Dubes. Algorithms for clustering data. Prentice Hall, 1988.
18. G. Karypis, E. Han, and V. Kumar. Chameleon: A hierarchical clustering algorithm using dynamic modeling. IEEE COMPUTER, 32:68-75, 1999.
19. L. Kaufman and P. Rousseeuw. Finding groups in data: an introduction to cluster analysis. John Wiley & Sons, 1990.
20. J. MacQueen. Some methods for classification and analysis of multivariate observations. In 5th Berkeley Symp. Math. Statist. prob., pages 281-297, 1967.
21. N. Megiddo and K. J. Supowit. On the complexity of some common geometric location problems. SIAM J. Comput., 13(1):182-196, 1984.
22. R. Ng and J. Han. Efficient and effective clustering methods for spatial data mining. In VLDB, 1994.
23. J. Scott. Social Network Analysis: A handbook. Sage, London, 2000.
24. C. Toregas, R. Swan, C. Revelle, and L. Bergman. The location of emergency service facilities. Oper. Res., 19:1363-1373, 1971.
25. A. K. H. Tung, R. T. Ng, L. V. S. Lakshmanan, and J. Han. Constraint-based clustering in large databases. In ICDT, pages 405-419, 2001.
26. S. Wasserman and K. Faust. Social Network Analysis. Cambridge Univ. Press, 1994.
27. C. Webster and P. Morrison. Network analysis in marketing. Australasian Marketing Journal, 12(2):8-18, 2004.