Sciweavers

165 search results - page 24 / 33
» Mining Compressed Frequent-Pattern Sets
Sort
View
JIIS
2010
106views more  JIIS 2010»
13 years 3 months ago
A new classification of datasets for frequent itemsets
The discovery of frequent patterns is a famous problem in data mining. While plenty of algorithms have been proposed during the last decade, only a few contributions have tried to ...
Frédéric Flouvat, Fabien De Marchi, ...
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
14 years 9 months ago
Characteristic relational patterns
Research in relational data mining has two major directions: finding global models of a relational database and the discovery of local relational patterns within a database. While...
Arne Koopman, Arno Siebes
KDD
2010
ACM
214views Data Mining» more  KDD 2010»
14 years 29 days ago
Neighbor query friendly compression of social networks
Compressing social networks can substantially facilitate mining and advanced analysis of large social networks. Preferably, social networks should be compressed in a way that they...
Hossein Maserrat, Jian Pei
ALMOB
2006
102views more  ALMOB 2006»
13 years 9 months ago
Mining, compressing and classifying with extensible motifs
Background: Motif patterns of maximal saturation emerged originally in contexts of pattern discovery in biomolecular sequences and have recently proven a valuable notion also in t...
Alberto Apostolico, Matteo Comin, Laxmi Parida
ICDM
2005
IEEE
133views Data Mining» more  ICDM 2005»
14 years 2 months ago
Parameter-Free Spatial Data Mining Using MDL
Consider spatial data consisting of a set of binary features taking values over a collection of spatial extents (grid cells). We propose a method that simultaneously finds spatia...
Spiros Papadimitriou, Aristides Gionis, Panayiotis...