Joint cluster analysis of attribute data and relationship data: The connected k-center problem, algorithms and applications

ACM Transactions on Knowledge Discovery from Data

Volumn 2, Issue 2, 2008, Pages 7-

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

^a SIMON FRASER UNIVERSITY   (Canada)

^b ARIEL UNIVERSITY   (Israel)

Author keywords

Approximation algorithms; Attribute data; Community identification; Document clustering; Joint cluster analysis; Market segmentation; NP hardness; Relationship data

Indexed keywords

APPROXIMABILITY; AS RELATIONSHIP; ATTRIBUTE DATA; CLUSTERING MODELS; COMMUNITY IDENTIFICATION; COMPLEMENTARY INFORMATION; CONSTANT-FACTOR APPROXIMATION ALGORITHMS; DATA TYPING; DOCUMENT CLUSTERING; EXPERIMENTAL EVALUATIONS; JOINT CLUSTER ANALYSIS; K-CENTER; K-CENTER PROBLEM; MARKET SEGMENTATION; METABOLIC NETWORKS; NP-HARDNESS; OPTIMAL SOLUTIONS; POLYNOMIAL-TIME; REAL DATABASES; REAL DATASETS; RELATIONSHIP DATA; SOCIAL NETWORKS; TREE STRUCTURES;

APPROXIMATION ALGORITHMS; CHLORINE COMPOUNDS; CLUSTER ANALYSIS; HEURISTIC ALGORITHMS; HEURISTIC PROGRAMMING; MATHEMATICAL PROGRAMMING; MEASUREMENT THEORY; NUCLEAR PROPULSION; POLYNOMIAL APPROXIMATION; RANDOM VARIABLES; SYSTEMS ENGINEERING;

TREES (MATHEMATICS);

EID: 49149121323     PISSN: 15564681     EISSN: 1556472X     Source Type: Journal    
DOI: None     Document Type: Article

References (57)

1. A GALRWAL, P. AND PROCOPIUC, C. M. 2002. Exact and approximation algorithms for clustering. Algorithmica 33, 2, 201-226.
2. ANKERST, M., BREUNIG, M. M., KRIEGEL, H., AND SANDER, J. 1999. Optics: Ordering points to identify the clustering structure. In Proceedings of the ACM SIGMOD International Conference on Management of Data (Philadelphia, PA). ACM, New York, 49-60.
3. BARABASI, A. L., JEONG, H., NEDA, Z., RAVASZ, E., SCHUBERT, A., AND VICSEKS, T. 2002. Evolution of the social network of scientific collaborations. Physica A 311, 3-4, 590-614.
4. BARTAL, Y., CHARIKAR, M.,AND RAZ,D. 2001. Approximating min-sumk-clusteringinmetric spaces. In Proceedings on 33rd Annual ACM Symposium on Theory of Computing (Hersonissos, Greece). ACM, New York, 11-20.
5. BASU, S., BILENKO, M., AND MOONEY, R. J. 2004. A probabilistic framework for semi-supervised clustering. In Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (Seattle, WA). ACM, New York, 59-68.
6. BERRIZ, G. F., KING, O. D., BRYANT, B., Sander, C., AND ROTH, F. P. 2003. Characterizing gene sets with funcassociate. Bioinformatics 19, 18, 2502-2504.
7. BRANDES, U., GAERTLER, M., AND WAGNER, D. 2003. Experiments on graph clustering algorithms. In Proceedings of the 11th Annual European Symposium on Algorithms (Budapest, Hungary). Springer-Verlag, Berlin/Heidelberg, Germany, 568-579.
8. BRUCKER, P. 1977. On the complexity of clustering problems. In Optimization and Operations Research, R. Hehn, B. Korte, and W. Oettli, Eds. Springer-Verlag, Berlin, Germany, 45-54.
9. CHAN, P. K., SCHLAG, M. D. F., AND ZIEN, J. Y. 1994. Spectral k-way ratio-cut partitioning and clustering. IEEE Trans. Computer-Aided Desi. Integ. Circ. Syst. 13, 9, 1088-1096.
10. CHARIKAR, M., GUHA, S., TARDOS, E., AND SHMOYS, D. 1999. A constant factor approximation algorithm for the k-median problem. J. Comput. Syst. Sci. 65, 1, 129-149.
11. CHARIKAR, M. AND PANIGRAHY, R. 2004. Clustering to minimize the sum of cluster diameters. J. Comput. Syst. Sci. 68, 2, 417-441.
12. CITESEER. 2006. Scientific literature digital library. http://citeseer.ist.psu.edu/.
13. DAVIDSON, I. AND RAVI , S. S. 2005. Clustering with constraints: Feasibility issues and the k-means algorithm. In Proceedings of the 5th SIAM International Conference on Data Mining (Newport Beach, CA). Society for Industrial and Applied Mathematics, Philadelphia, PA, 138-149.
14. DBLP. Computer science bibliography. http://www.informatik.uni-trier.de/ ∼ley/db/index.html.
15. DHILLON, I. S., GUAN, Y., AND KULIS, B. 2007. Weighted graph cuts without eigenvectors: A multilevel approach. IEEE Transactions on Pattern Analysis and Machine Intelligence 29, 11, 1944-1957.
16. DODDI, S., MARATHE, M. V., RAVI, S. S., TAYLOR, D., AND WIDMAYER, P. 2000. Approximation algorithms for clustering to minimize the sum of diameters. In Proceedings of the 7th Scandinavian Workshop on Algorithm Theory (Bergen, Norway). Springer-Verlag, Berlin/Heidelberg, Germany, 237-250.
17. DYER, M. AND FRIEZE, A. M. 1985. A simple heuristic for the p-center problem. Oper. Res. Lett. 3, 285-288.
18. ESTER, M., GE, R., GAO, B. J., HU, Z., AND BEN-MOSHE, B. 2006. Joint cluster analysis of attribute data and relationship data: the connected k-center problem. In Proceedings of the 6th SIAM Conference on Data Mining (Bethesda, MD). Society for Industrial and Applied Mathematics, Philadelphia, PA, 246-257.
19. ESTER, M., KRIEGEL, H., Sander, J., and XU, X. 1996. A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (Portland, OR). AAAI Press, 226-231.
20. FEDER, T. AND GREENE,D. H. 1988. Optimal algorithms for approximate clustering. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing(Chicago, IL). ACM, New York, 434-444.
21. FREDERICKSON, G. N. AND JOHNSON, D. B. 1979. Optimal algorithms for generating quantile information in x + y and matrices with sorted columns. In Proceedings of the 13th Annual Conference on Information Science and Systems. The Johns Hopkins Univ., Baltimore, MD, 47-52.
22. GONZALEZ,T. 1985. Clusteringtominimize the maximum inter-cluster distance.Theoret. Comput. Sci. 38, 2-3, 293-306.
23. GUHA, S., RASTOGI, R., AND SHIM, K. 1999. Rock: A robust clustering algorithm for categorical attributes. In Proceedings of the 15th International Conference on Data Engineering (Sydney, Austrialia). IEEE Computer Society, Los Alamitos, CA, 512-521.
24. GUTTMAN-BECK, N. AND HASSIN, R. 1998. Approximation algorithms for min-sum p-clustering. Disc. Appl. Math. 89, 1-3, 125-142.
25. HANISCH, D., ZIEN, A., ZIMMER, R., AND LENGAUER, T. 2002. Co-clustering of biological networks and gene expression data. Bioinformatics 18, S145-S154.
26. HANNEMAN, R. A. AND RIDDLE, M. 2005. Introduction to social network methods. http://faculty.ucr.edu/ ∼hanneman/.
27. HARTUV, E. AND SHAMIR, R. 2000. A clustering algorithm based on graph connectivity. Inf. Proc. Lett. 76, 4-6, 175-181.
28. HOCHBAUM, D. AND SHMOYS, D. 1985. A best possible heuristic for the k-center problem. Math. Oper. Res. 10, 180-184.
29. IACOBUCCI, D. 1996. Networks in Marketing. Sage Publications, Thousand Oaks, CA.
30. JAIN, A. AND DUBES, R. 1988. Algorithms for clustering data. Prentice-Hall, Englewood Cliffs, NJ.
31. JAIN, K. AND VAZIRANI, V. 2001. Approximation algorithms for metric facility location and k-median problems using the primal-dual scheme and lagrangian relaxation. J. ACM 48, 2, 274-296.
32. KARIV, O. AND HAKIMI, S. L. 1979. An algorithmic approach to network location problems, Part II: p-medians. SIAM J. Appl. Math. 37, 539-560.
33. KARYPIS, G., HAN, E., AND KUMAR, V. 1999. Chameleon: Hierarchical clustering using dynamic modeling. IEEE Comput. 32, 8, 68-75.
34. KAUFMAN, L. AND ROUSSEEUW, P. 1990. Finding Groups in Data: An Introduction to Cluster Analysis. Wiley, New York.
35. KULIS, B., BASU, S., DHILLON, I. S., AND MOONEY, R. 2005. Semi-supervised graph clustering: A kernel approach. In Proceedings of the 22nd International Conference on Machine Learning (Bonn, Germany). ACM, New York, 457-464.
36. LIN, J. AND VITTER, J. 1992. Approximation algorithms for geometric median problems. Inf. Proc. Lett. 44, 5, 245-249.
37. LLOYD, S. 1982. Least squares quantization in pcm. IEEE Trans. Inf. Theory 28, 2, 129-136.
38. MACQUEEN,J. 1967. Some methods for classification and analysisofmultivariate observations. In Proceedings of the 5th Berkeley Symposium on Mathematics, Statistics and Probability. 281-297.
39. MEGIDDO, N. AND SUPOWIT, K. J. 1984. On the complexity of some common geometric location problems. SIAM Journal on Computing 13, 1, 182-196.
40. 2 n) algorithm for the k-th longest path in a tree with applications to location problems. SIAM J. Comput. 10, 2, 328-337.
41. MOSER, F., GE, R., AND ESTER, M. 2007. Joint cluster analysis of attribute and relationship data without a-priori specification of the number of clusters. In Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (San Jose, CA). ACM, New York.
42. NG, R. T. AND HAN, J. 1994. Efficient and effective clustering methods for spatial data mining. In Proceedings of the 20th International Conference on Very Large Data Bases (Santiago de Chile, Chile). Morgan Kaufmann, San Francisco, CA, 144-155.
43. SCOTT, J. 2000. Social Network Analysis: A handbook. Sage Publications, Thousand Oaks, CA.
44. SEGAL, E., WANG, H., AND KOLLER, D. 2003. Discovering molecular pathways from protein interaction and gene expression data. Bioinformatics (Suppl. 1) 19, 264-272.
45. SHI, J. AND MALIK, J. 2000. Normalized cuts and image segmentation. IEEE Trans. Patt. Analysis and Machine Intelligence 22, 8, 888-905.
46. SPELLMAN, P. T., SHERLOCK, G., ZHANG, M. Q., IYER, V. R., ANDERS, K., EISEN, M. B., BROWN, P. O., BOTSTEIN, D., AND FUTCHER, B. 1998. Comprehensive identification of cell cycle-regulated genes of the yeast saccharomyces cerevisiae by microarray hybridization. Molec. Biol. Cell 9, 12, 3273-3297.
47. STARK, C., BREITKREUTZ, B., REGULY, T., BOUCHER, L., BREITKREUTZ, A., AND TYERS, M. 2006. Biogrid: A general repository for interaction datasets. Nucleic Acids Res. 34, D535-D539.
48. STEINBACH, M., KARYPIS, G., AND KUMAR, V. 2000. A comparison of document clustering techniques. In KDD Workshop on Text Mining.
49. STEINHAUS, H. 1956. Sur la division des corp materiels en parties. Bulletin L'Acadmie Polonaise des Science C1. III, IV, 801-804.
50. SWAMY, C., AND KUMAR, A. 2004. Primal-dual algorithms for connected facility location problems. Algorithmica 40, 4, 245-269.
51. 2) algorithm for the p-median and related problems on tree graphs. Operations Research Letters 19, 59-64.
52. TASKAR, B., SEGAL, E., AND KOLLER, D. 2001. Probabilistic classification and clustering in relational data. In Proceedings of 17th International Joint Conference on Artificial Intelligence (Seattle, WA). Morgan Kaufmann, San Francisco, CA, 870-878.
53. TOREGAS, C., SWAN, R., REVELLE, C., AND BERGMAN, L. 1971. The location of emergency service facilities. Oper. Res. 19, 1363-1373.
54. TUNG, A. K. H., NG, R. T., LAKSHMANAN, L. V. S., AND HAN, J. 2001. Constraint-based clustering in large databases. In Proceedings of the 8th International Conference on Database Theory (London, UK). Springer-Verlag, New York, 405-419.
55. ULITSKY, I. AND SHAMIR, R. 2007. Identification of functional modules using network topology and high-throughput data. BMC System Biology 1, 8.
56. WASSERMAN, S. AND FAUST, K. 1994. Social Network Analysis. Cambridge University Press, Cambridge, UK.
57. WEBSTER, C.ANDMORRISON,P. 2004. Network analysisinmarketing.Australasian Market. J. 12,2, 8-18.