Geometric and combinatorial tiles in 0-1 data

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3202, Issue , 2004, Pages 173-184

  Gionis, Aristides ^a   Mannila, Heikki ^a   Seppänen, Jouni K ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

PROBABILISTIC MODELING; PROBABILITY P; RANDOMIZED ALGORITHMS;

GEOMETRY;

EID: 35048851762     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30116-5_18     Document Type: Article

References (23)

1. C. Aggarwal and P. Yu. Finding generalized projected clusters in high dimensional spaces. In SIGMOD, 2000.
2. R. Agrawal, J. Gehike, D. Gunopulos, and P. Raghavan. Automatic subspace clustering of high dimensional data for data mining applications. In SIGMOD, 1998.
3. R. Agrawal, T. Imielinski, and A. Swami. Mining associations between sets of items in large databases. In SIGMOD, 1993.
4. J. Atkins, E. Boman, and B. Hendrickson. A spectral algorithm for seriation and the consecutive ones problem. SIAM Journal on Computing, 28(1), 1999.
5. A. Beygelzimer, C.-S. Perng, and S. Ma. Fast ordering of large categorical datasets for better visualization. In SIGKDD, 2001.
6. T. Calders and B. Goethals. Mining all non-derivable frequent itemsets. In PKDD, 2002.
7. C. Cheng, A. Fu, and Y. Zhang. Entropy-based subspace clustering for mining numerical data. In SIGKDD, 1999.
8. Y. Cheng and G. Church. Biclustering of expression data. In ISMB, 2000.
9. F. Chung. Spectral graph theory. American Mathematical Society, 1997.
10. J. Edmonds, J. Gryz, D. Liang, and R. J. Miller. Mining for empty spaces in large data sets. Theor. Comput. Sci., 296(3):435-452, 2003.
11. M. Fiedler. Algebraic connectivity of graphs. Czech. Math. J., 23, 1973.
12. J. Friedman and J. Meulman. Clustering objects on subsets of attributes. JRSS B, 2004.
13. B. Gaines and P. Compton. Induction of ripple-down rules applied to modeling large databases. JIIS, 5(3), 1993.
14. J. Han, J. Wang, Y. Lu, and P. Tzvetkov. Mining top-k frequent closed patterns without minimum support. In ICDM, 2002.
15. A. Jain, M. Murty, and P. Flynn. Data clustering: A review. ACM Computing Surveys, 1999.
16. J. Kivinen, H. Mannila, and E. Ukkonen. Learning hierarchical rule sets. In COLT, 1992.
17. Y. Koren and D. Harel. Multi-scale algorithm for the linear arrangement problem. Technical Report MCS02-04, The Weizmann Institute of Science, 2002.
18. B. Liu, L.-P. Ku, and W. Hsu. Discovering interesting holes in data. In IJCAI, 1997.
19. T. Murali and S. Kasif. Extracting conserved gene expression motifs from gene expression data. In Pac. Symp. Biocomp., volume 8, 2003.
20. A. Ng, M. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. In NIPS, 2001.
21. A. Pothen, H. Simon, and L. Wang. Spectral nested dissection. Technical Report CS-92-01, Pennsylvania State University, Department of Computer Science, 1992.
22. R. Rivest. Learning decision lists. Machine Learning, 2(3), 1987.
23. H. Zha, X. He, C. Ding, M. Gu, and H. Simon. Bipartite graph partitioning and data clustering. In CIKM, 2001.