Sciweavers

Share
4 search results - page 1 / 1
» Maximally informative k-itemsets and their efficient discove...
Sort
View
KDD
2006
ACM
150views Data Mining» more  KDD 2006»
13 years 2 months ago
Maximally informative k-itemsets and their efficient discovery
In this paper we present a new approach to mining binary data. We treat each binary feature (item) as a means of distinguishing two sets of examples. Our interest is in selecting ...
Arno J. Knobbe, Eric K. Y. Ho
DAWAK
2006
Springer
12 years 5 months ago
Efficient Mining of Large Maximal Bicliques
Abstract. Many real world applications rely on the discovery of maximal biclique subgraphs (complete bipartite subgraphs). However, existing algorithms for enumerating maximal bicl...
Guimei Liu, Kelvin Sim, Jinyan Li
DAGSTUHL
2006
12 years 3 months ago
Point-set algorithms for pattern discovery and pattern matching in music
An algorithm that discovers the themes, motives and other perceptually significant repeated patterns in a musical work can be used, for example, in a music information retrieval sy...
David Meredith
KDD
2004
ACM
168views Data Mining» more  KDD 2004»
13 years 2 months ago
Mining, indexing, and querying historical spatiotemporal data
In many applications that track and analyze spatiotemporal data, movements obey periodic patterns; the objects follow the same routes (approximately) over regular time intervals. ...
Nikos Mamoulis, Huiping Cao, George Kollios, Mario...
books