Sciweavers

2932 search results - page 139 / 587
» Higher order mining
Sort
View
KDD
2002
ACM
189views Data Mining» more  KDD 2002»
16 years 6 months ago
Sequential PAttern mining using a bitmap representation
We introduce a new algorithm for mining sequential patterns. Our algorithm is especially efficient when the sequential patterns in the database are very long. We introduce a novel...
Jay Ayres, Jason Flannick, Johannes Gehrke, Tomi Y...
ICMCS
2008
IEEE
115views Multimedia» more  ICMCS 2008»
16 years 16 days ago
Spatial pyramid mining for logo detection in natural scenes
This work introduces a novel data mining scheme, spatial pyramid mining, to discover association rules at multiple resolutions in order to identify frequent spatial configuration...
Jim Kleban, Xing Xie, Wei-Ying Ma
165
Voted
ICCS
2007
Springer
16 years 7 days ago
Mining Frequent Closed Unordered Trees Through Natural Representations
Abstract. Many knowledge representation mechanisms consist of linkbased structures; they may be studied formally by means of unordered trees. Here we consider the case where labels...
José L. Balcázar, Albert Bifet, Anto...
PKDD
2005
Springer
92views Data Mining» more  PKDD 2005»
15 years 11 months ago
Mining Model Trees from Spatial Data
Mining regression models from spatial data is a fundamental task in Spatial Data Mining. We propose a method, namely Mrs-SMOTI, that takes advantage from a tight-integration with s...
Donato Malerba, Michelangelo Ceci, Annalisa Appice
DIS
2007
Springer
15 years 10 months ago
Efficient Incremental Mining of Top-K Frequent Closed Itemsets
In this work we study the mining of top-K frequent closed itemsets, a recently proposed variant of the classical problem of mining frequent closed itemsets where the support thresh...
Andrea Pietracaprina, Fabio Vandin