Spectral ordering for finding dense or sparse submatrices
Abstract: In this paper we introduce a simple probabilistic model, hierarchical tiles, for 0-1 data. A basic tile (X,Y,p) specifies a subset X of the rows and a subset Y of the columns of the data, i.e., a rectangle, and gives a probability p for the occurrence of 1s in the cells of X x Y. A hierarchical tile has additionally a set of exception tiles that specify the probabilities for subrectangles of the original rectangle. If the rows and columns are ordered and X and Y consist of consecutive elements... (Update)
Active bibliography (related documents): More All
1.4: Automated Modeling and Nonlinear Axis Scaling - Leejay Wu (2005)
(Correct)
0.7: triCluster: An Effective Algorithm for Mining Coherent Clusters .. - Zhao, Zaki
(Correct)
0.3: Diagrammatic Representations in Domain-Specific Languages - Tourlas (2000)
(Correct)
Similar documents based on text: More All
0.4: Finding Similar Situations in Sequences of Events Via Random .. - Mannila, Seppänen (2001)
(Correct)
0.3: A Simple Algorithm for Topic Identification in 0-1 Data - Seppänen, Bingham, Mannila (2003)
(Correct)
0.3: Clustered Segmentations - Gionis, Mannila, Terzi
(Correct)
BibTeX entry: (Update)
@inproceedings{ gionis04:tiles,
author = {Aristides Gionis and Heikki Mannila and Jouni
K. Sepp{\"a}nen},
title = {Geometric and combinatorial tiles in 0-1 data},
booktitle = {Proc. PKDD},
year = 2004,
editor = {J.-F. Boulicaut and F. Esposito and F. Giannotti and
D. Pedreschi},
volume = 3202,
series = {LNAI},
address = {Pisa, Italy},
month = sep,
url = {citeseer.ist.psu.edu/gionis04geometric.html} }
Citations (may not include all citations):
475
Automatic subspace clustering of high dimensional data for d..
- Agrawal, Gehrke et al. - 1998
215
Learning decision lists
- Rivest - 1987
194
Entropy-based subspace clustering for mining numerical data
- Cheng, Fu et al. - 1999
190
Data clustering: A review
- Jain, Murty et al. - 1999
108
Algebraic connectivity of graphs (context) - Fiedler - 1973
93
American Mathematical Society (context) - Chung, theory - 1997
88
Eigenvalues and graph bisection: An average-case analysis (context) - Boppana - 1987
72
On spectral clustering: Analysis and an algorithm
- Ng, Jordan et al. - 2001
35
Finding generalized projected clusters in high dimensional s..
- Aggarwal, Yu - 2000
34
Biclustering of expression data
- Cheng, Church - 2000
33
Mining all non-derivable frequent itemsets
- Calders, Goethals - 2002
13
Bipartite graph partitioning and data clustering
- Zha, He et al. - 2001
11
A spectral algorithm for seriation and the consecutive ones ..
- Atkins, Boman et al. - 1999
10
frequent closed patterns without minimum support (context) - Han, Wang et al. - 2002
9
Multi-scale algorithm for the linear arrangement problem
- Koren, Harel - 2002
7
Discovering interesting holes in data (context) - Liu, Ku et al. - 1997
6
Mining associations between sets of items in large databases (context) - Agrawal, Imielinski et al. - 1993
5
Induction of ripple-down rules applied to modeling large dat..
- Gaines, Compton - 1993
5
Learning hierarchical rule sets
- Kivinen, Mannila et al. - 1992
5
Extracting conserved gene expression motifs from gene expres..
- Murali, Kasif - 2003
3
Mining for empty spaces in large data sets (context) - Edmonds, Gryz et al. - 2003
3
Department of Computer Science (context) - Pothen, Simon et al. - 1992
2
Clustering objects on subsets of attributes
- Friedman, Meulman - 2004
1
Fast ordering of large categorical datasets for better visua.. (context) - Beygelzimer, Perng et al. - 2001
Documents on the same site (http://www.cs.helsinki.fi/u/mannila/): More
The Pattern Ordering Problem - Mielikäinen, Mannila (2003)
(Correct)
A Simple Algorithm for Topic Identification in 0-1 Data - Seppänen, Bingham, Mannila (2003)
(Correct)
Approximating a Collection of Frequent Sets - Foto Afrati National
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC