Sciweavers

2932 search results - page 188 / 587
» Higher order mining
Sort
View
KDD
2008
ACM
138views Data Mining» more  KDD 2008»
16 years 7 months ago
Quantitative evaluation of approximate frequent pattern mining algorithms
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
Rohit Gupta, Gang Fang, Blayne Field, Michael Stei...
ICDM
2007
IEEE
166views Data Mining» more  ICDM 2007»
16 years 25 days ago
Mining Statistical Information of Frequent Fault-Tolerant Patterns in Transactional Databases
Constraints applied on classic frequent patterns are too strict and may cause interesting patterns to be missed. Hence, researchers have proposed to mine a more relaxed version of...
Ardian Kristanto Poernomo, Vivekanand Gopalkrishna...
KDD
2007
ACM
179views Data Mining» more  KDD 2007»
16 years 19 days 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
IADIS
2003
15 years 7 months ago
Informatization and E-Business Model Application for Distributed Data Mining Using Mobile Agents
Distributed data mining (DDM) is the semi-automatic pattern extraction of distributed data sources. The next generation of the data mining studies will be distributed data mining ...
Ezendu Ifeanyi Ariwa, Mohamed B. Senousy, Mohamed ...
SDM
2004
SIAM
207views Data Mining» more  SDM 2004»
15 years 7 months ago
BAMBOO: Accelerating Closed Itemset Mining by Deeply Pushing the Length-Decreasing Support Constraint
Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation t...
Jianyong Wang, George Karypis