Sciweavers

697 search results - page 90 / 140
» Mining negative association rules
Sort
View
KDD
2006
ACM
198views Data Mining» more  KDD 2006»
16 years 5 months ago
CFI-Stream: mining closed frequent itemsets in data streams
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...
Nan Jiang, Le Gruenwald
SNAM
2011
246views more  SNAM 2011»
14 years 11 months ago
Market basket analysis with networks
The field of market basket analysis, the search for meaningful associations in customer purchase data, is one of the oldest areas of data mining. The typical solution involves th...
Troy Raeder, Nitesh V. Chawla
ICPP
2006
IEEE
15 years 10 months ago
Adaptively Routing P2P Queries Using Association Analysis
Unstructured peer-to-peer networks have become a very popular method for content distribution in the past few years. By not enforcing strict rules on the network’s topology or c...
Brian D. Connelly, Christopher W. Bowron, Li Xiao,...
KDD
1995
ACM
99views Data Mining» more  KDD 1995»
15 years 8 months ago
Active Data Mining
We introduce an active data mining paradigm that combines the recent work in data mining with the rich literature on active database systems. In this paradigm, data is continuousl...
Rakesh Agrawal, Giuseppe Psaila
ICFCA
2007
Springer
15 years 11 months ago
A Parameterized Algorithm for Exploring Concept Lattices
Kuznetsov shows that Formal Concept Analysis (FCA) is a natural framework for learning from positive and negative examples. Indeed, the results of learning from positive examples (...
Peggy Cellier, Sébastien Ferré, Oliv...