Sciweavers

873 search results - page 57 / 175
» Reducing the Frequent Pattern Set
Sort
View
CINQ
2004
Springer
125views Database» more  CINQ 2004»
14 years 1 months ago
Deducing Bounds on the Support of Itemsets
Mining Frequent Itemsets is the core operation of many data mining algorithms. This operation however, is very data intensive and sometimes produces a prohibitively large output. I...
Toon Calders
KDD
2009
ACM
196views Data Mining» more  KDD 2009»
14 years 2 months ago
WhereNext: a location predictor on trajectory pattern mining
The pervasiveness of mobile devices and location based services is leading to an increasing volume of mobility data. This side effect provides the opportunity for innovative meth...
Anna Monreale, Fabio Pinelli, Roberto Trasarti, Fo...
KDD
2007
ACM
179views Data Mining» more  KDD 2007»
14 years 2 months ago
Mining statistically important equivalence classes and delta-discriminative emerging patterns
The support-confidence framework is the most common measure used in itemset mining algorithms, for its antimonotonicity that effectively simplifies the search lattice. This com...
Jinyan Li, Guimei Liu, Limsoon Wong
IPPS
2008
IEEE
14 years 2 months ago
Parallel mining of closed quasi-cliques
Graph structure can model the relationships among a set of objects. Mining quasi-clique patterns from large dense graph data makes sense with respect to both statistic and applica...
Yuzhou Zhang, Jianyong Wang, Zhiping Zeng, Lizhu Z...
MOBIHOC
2002
ACM
14 years 7 months ago
Path set selection in mobile ad hoc networks
Topological changes in mobile ad hoc networks frequently render routing paths unusable. Such recurrent path failures have detrimental effects on the network ability to support QoS...
Emin Gün Sirer, Panagiotis Papadimitratos, Zy...