A new conceptual clustering framework

Machine Learning

Volumn 56, Issue 1-3, 2004, Pages 115-151

  Mishra, Nina ^a,b   Ron, Dana ^c   Swaminathan, Ram ^a  

^a HEWLETT PACKARD LABORATORIES   (United States)

^b Stanford University   (United States)

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

Conceptual clustering; Maximum edge biclustering

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DATA ACQUISITION; DATA PROCESSING; GRAPH THEORY; INFORMATION RETRIEVAL; METRIC SYSTEM; RANDOM PROCESSES;

BIPARTITE GRAPHS; CONCEPTUAL CLUSTERING; MAXIMUM EDGE BICLUSTERING; RANDOMIZED ALGORITHMS;

LEARNING SYSTEMS;

EID: 3142661068     PISSN: 08856125     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:MACH.0000033117.77257.41     Document Type: Article

References (58)

1. Agrawal, R., Gehrke, I. E., Gunopulos, D., & Raghavan, P. (1998). Automatic subspace clustering of high dimensional data for data mining applications. In Proceedings of the ACM SIGMOD International Conference on Management of Data (pp. 94-105).
2. Agrawal, R., Imielinski, T., & Swami, A. (1993). Mining association rules between sets of items in large databases. In Proceedings of the ACM SIGMOD International Conference on Management of Data (pp. 207216).
3. Alon, N., Dar, S., Parnas, M., & Ron, D. (2003). Testing of clustering. SIAM Journal on Discrete Math, 393-417.
4. Alon, N., Fischer, E., Krivelevich, M., & Szegedy, M. (2000). Efficient testing of large graphs. Combinatorica, 20, 451-76.
5. Arora, S., Karger, D., & Karpinski, M. (1995). Polynomial time approximation schemes for dense instances of NP-hard problems. In Proceedings of the 27th Annual ACM Symposium on the Theory of Computing (pp. 284-293).
6. Arya, V., Garg, N., Khandekar, R., Munagala, K., & Pandit, V. (2001). Local search heuristic for k-median and facility location problems. In Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing (pp. 21-29).
7. Babcock, B., Datar, M., Motwani, R., & O'Callaghan, L. (2003). Maintaining variance and k-medians over data stream windows. In Proceedings of the 22nd ACM Symposium on Principles of Database Systems (pp. 234-243).
8. Bansal, N., Blum, A., & Chawla, S. (2002). Correlation clustering. In Proceedings of the 43rd Annual Symposium on Foundations of Computer Science (pp. 238-247).
9. Charikar, M. (2000). Greedy approximation algorithms for finding dense components in a graph. In Proceedings of the 3rd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (pp. 84-95).
10. Charikar, M., Chekuri, C., Feder, T., & Motwani, R. (1997). Incremental clustering and dynamic information retrieval. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing (pp. 626-635).
11. Charikar, M., & Guha, S. (1999). Improved combinatorial algorithms for the facility location and k-median problems. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science (pp. 378-388).
12. Charikar, M., Guruswami, V., & Wirth, A. (2003). Clustering with qualitative information. In Proceedings of the 44th Annual Symposium on Foundations of Computer Science (pp. 524-533).
13. Charikar, M., O'Callaghan, L., & Panigrahy, R. (2003). Better streaming algorithms for clustering problems. In Proceedings of the 35th Annual ACM Symposium on the Theory of Computing (pp. 30-39).
14. Cheng, Y., & Church, G. (2000). Biclustering of expression data. In Proceedings of the 8th International Conference on Intelligent Systems for Molecular Biology (pp. 93-103).
15. Fernandez de la Vega, W. (1996). MAX-CUT has a randomized approximation scheme in dense graphs. Random Structures and Algorithms, 8:3, 187-198.
16. Demaine, E., & Immorlica, N. (2003). Correlation clustering with partial information. In, Proceedings of the 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (pp. 1-13).
17. Dempster, A., Laird, N., & Rubin, D. (1977). Maximum likelihood from incomplete data via the EM algorithm (with discussion). Journal of the Royal Statistical Society Series B, 39, 1-38.
18. Dhillon, I. (2001). Co-clustering documents and words using bipartite spectral graph partitioning. In Knowledge Discovery and Data Mining (pp. 269-274).
19. Dhillon, I., Mallela, S., & Modha, D. (2003). Information-theoretic co-clustering. In Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 89-98).
20. Duda, R., Hart, P., & Stork, D. (2000). Pattern classification, 2nd edn. (vol. November). New York: John Wily & Sons, Inc.
21. Emmanuel, D., & Fiat, A. (2003). Correlation clustering-Minimizing disagreements on arbitrary weighted graphs. In Proceedings of the 11th European Symposium on Algorithms (pp. 208-220).
22. Feder, T., & Greene, D. (1988). Optimal algorithms for approximate clustering. In Proceedings of the 20th Annual ACM Symposium on the Theory of Computing (pp. 434-444).
23. Feder, T., & Motwani, R. (1995). Clique partitions, graph compression and speeding-up algorithms. J. Computer and System Sciences, 51, 261-272.
24. Feige, U. (2002). Relations between average case complexity and approximation complexity. In Proceedings of the 34th Annual ACM Symposium on the Theory of Computing (pp. 534-543).
25. Fisher, D., & Langley, P. (1985). Approaches to conceptual clustering. In Proceedings of the 9th International Joint Conference on Artificial Intelligence, vol II (pp. 691-697).
26. Flake, G., Lawrence, S., & Giles, C. L. (2000). Efficient identification of web communities. In Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 150160).
27. Frieze, A., & Kanan, R. (1999). Quick approximation to matrices and applications. Combinatorica, 19:2, 175-220.
28. Ganti, V., Gehrke, J., & Ramakrishnan, R. (1999). CACTUS-Clustering categorical data using summaries. In Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 73-83).
29. Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman and Company.
30. Gibson, D., Kleinberg, J., & Raghavan, P. (1998). Inferring web communities from link topology. In Proceedings of the 9th ACM Conference on Hypertext and Hypermedia (pp. 225-234).
31. Gibson, D., Kleinberg, J., & Raghavan, P. (2000). Clustering categorical data: An approach based on dynamical systems. VLDB Journal: Very Large Data Bases, 8:3/4, 222-236.
32. Goldberg, A. (1984). Finding a maximum density subgraph. UC Berkeley Tech Report, CSD-84-171.
33. Goldreich, O., Goldwasser, S., & Ron, D. (1998). Property testing and its connection to learning and approximation. Journal of the ACM, 45:4, 653-750.
34. Guha, S., Meyerson, A., Mishra, N., Motwani, R., & O'Callaghan, L. (2003). Clustering data streams: Theory and practice. IEEE Transactions on Knowledge and Data Engineering, 15:3, 515-528.
35. Guha, S., Rastogi, R., & Shim, K. (2000). ROCK: A robust clustering algorithm for categorical attributes. Information Systems, 25:5, 345-366.
36. Gunopulos, D., Mannila, H., Khardon, R., & Toivonen, H. (1997). Data mining, hypergraph transversals, and machine learning. In Proceedings of the Sixteenth ACM SIG-SIGMOD-SIGART Symposium on Principles of Database Systems (pp. 209-216).
37. Hartigan, J. (1972). Direct clustering of a data matrix. Journal of the American Statistical Association, 67:337, 123-129.
38. Hochbaum, D. (1998). Approximating clique and biclique problems. Journal of Algorithms, 29:1, 174-200.
39. Hochbaum, D., & Shmoys, D. (1986). A unified approach to approximate algorithms for bottleneck problems. Journal of the ACM, 33:3, 533-550.
40. Indyk, P. (1999). Sublinear time algorithms for metric space problems. In Proceedings of the 31st Annual ACM Symposium on the Theory of Computing (pp, 428-434).
41. Jain, N., & Vazirani, V. (1999). Primal-dual approximation algorithms for metric facility location and k-median problems. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science (pp. 2-13).
42. Kannan, R., Vempala, S., & Vetta, A. (2000). On clusterings - Good, bad and spectral. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science (pp. 367-377).
43. Kanungo, T., Mount, D. M., Netanyahu, N., Piatko, C., Silverman, R., & Wu, A. Y. (2002). A local search approximation algorithm for k-means clustering. In Proceedings of the 18th Annual ACM Symposium on Computational Geometry (pp. 10-18).
44. Kleinberg, J., Papadimitriou, C., & Raghavan, P. (1998). Approximation algorithms for segmentation problems. In Proceedings of the 30th Annual ACM Symposium on the Theory of Computing (pp. 473-482).
45. Kumar, R., Raghavan, R, Rajagopalan, S., & Tomkins, A. (1999). Trawling the web for emerging cybercommunities. Computer Networks, 31:11-16, 1481-1493.
46. Madeira, S., & Oliveira, A. (2004). Biclustering algorithms for biological data analysis: A survey. Institute de Engenharia de Sistemas e Computadores, INESC-ID Tech. Rep. 1/2004. Lisbon, Portugal.
47. Michalskl, R. (1980). Knowledge acquisition through conceptual clustering: A theoretical framework and an algorithm for partitioning data into conjunctive concepts. Technical Report 1026, Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, Illinois.
48. Mishra, N., Oblinger, D., & Pitt, L. (2001). Sublinear time approximate clustering. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 439-447).
49. Murali, T., & Kasif, S. (2003). Extracting conserved gene expression motifs from gene expression data. In Pacific Symposium on Biocomputing (pp. 77-88).
50. Peeters, R. (2003). The maximum edge biclique problem is NP-complete. Discrete Applied Mathematics, 131:3, 651-654.
51. Pitt, L., & Reinke, R. E. (1987). Criteria for polynomial-time (conceptual) clustering. Machine Learning, 2:4, 371-396.
52. Procopiuc, C., Jones, M., Agarwal, P., & Murali, T. (2002). A Monte Carlo algorithm for fast protective clustering. In Proceedings of the ACM SIGMOD International Conference on Management of Data (pp. 418-427).
53. Selim, S., & Ismail, M. (1984). k-means type algorithms: A generalized convergence theorem and characterization of local optimality. IEEE Transansactions on Pattern Analysis and Machine Intelligence, 6:1, 81-86.
54. Tanay, A., Sharan, R., & Shamir, R. (2002). Discovering statistically significant biclusters in gene expression data. Bioinformatics, 18:1, 136-144.
55. Thorup, M. (2001). Quick k-median, k-center, and facility location for sparse graphs. In Proceedings of the Annual International Colloquium on Automata, Languages and Programming (pp. 249-260).
56. Peleg, D., Feige, U., & Kortsarz, G. (2001). The dense-k-subgraph problem. Algorithmica, 29:3, 410-421.
57. Vitter, J. (1985). Random sampling with a reservoir. ACM Transactions on Mathematical Software, 11:1, 3757.
58. Yannakakis, M. (1981). Node-deletion problems on bipartite graphs. SIAM Journal on Computing, 10:2, 310-327.