Sciweavers

165 search results - page 27 / 33
» Mining Compressed Frequent-Pattern Sets
Sort
View
PKDD
2007
Springer
147views Data Mining» more  PKDD 2007»
14 years 3 months ago
MINI: Mining Informative Non-redundant Itemsets
Frequent itemset mining assists the data mining practitioner in searching for strongly associated items (and transactions) in large transaction databases. Since the number of frequ...
Arianna Gallo, Tijl De Bie, Nello Cristianini
CIKM
2009
Springer
14 years 3 months ago
Compressing tags to find interesting media groups
On photo sharing websites like Flickr and Zooomr, users are offered the possibility to assign tags to their uploaded pictures. Using these tags to find interesting groups of sem...
Matthijs van Leeuwen, Francesco Bonchi, Börku...
ADMA
2006
Springer
112views Data Mining» more  ADMA 2006»
14 years 3 months ago
Finding Time Series Discords Based on Haar Transform
The problem of finding anomaly has received much attention recently. However, most of the anomaly detection algorithms depend on an explicit definition of anomaly, which may be i...
Ada Wai-Chee Fu, Oscar Tat-Wing Leung, Eamonn J. K...
SDM
2009
SIAM
175views Data Mining» more  SDM 2009»
14 years 6 months ago
Low-Entropy Set Selection.
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
Hannes Heikinheimo, Jilles Vreeken, Arno Siebes, H...
IADIS
2004
13 years 10 months ago
Mining Relaxed Graph Properties in Internet
Many real world datasets are represented in the form of graphs. The classical graph properties found in the data, like cliques or independent sets, can reveal new interesting info...
Wilhelmiina Hämäläinen, Hannu Toivo...