4 search results - page 1 / 1 » Maximally informative k-itemsets and their efficient discove... |
KDD
2006
ACM
14 years 4 months ago
2006
ACM
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 ...
DAWAK
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Many real world applications rely on the discovery of maximal biclique subgraphs (complete bipartite subgraphs). However, existing algorithms for enumerating maximal bicl...
DAGSTUHL
2006
13 years 5 months ago
2006
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...
KDD
2004
ACM
14 years 4 months ago
2004
ACM
In many applications that track and analyze spatiotemporal data, movements obey periodic patterns; the objects follow the same routes (approximately) over regular time intervals. ...