Sciweavers

88 search results - page 5 / 18
» Further Pruning for Efficient Association Rule Discovery
Sort
View
FLAIRS
2003
13 years 9 months ago
Logical Identities Applied to Knowledge Discovery in Databases
Data mining is the process of extracting implicit, previously unknown, and potentially useful information from data in databases. It is widely recognized as a useful tool for deci...
James P. Buckley, Jennifer Seitzer, Yongzhi Zhang,...
KDD
1999
ACM
217views Data Mining» more  KDD 1999»
13 years 11 months ago
An Efficient Algorithm to Update Large Itemsets with Early Pruning
We present an efficient algorithm (UWEP) for updating large itemsets when new transactions are added to the set of old transactions. UWEP employs a dynamic lookahead strategy in u...
Necip Fazil Ayan, Abdullah Uz Tansel, M. Erol Arku...
IDEAL
2003
Springer
14 years 22 days ago
Experiences of Using a Quantitative Approach for Mining Association Rules
In recent years interest has grown in “mining” large databases to extract novel and interesting information. Knowledge Discovery in Databases (KDD) has been recognised as an em...
L. Dong, Christos Tjortjis
CORR
2010
Springer
172views Education» more  CORR 2010»
13 years 5 months ago
Integrating User's Domain Knowledge with Association Rule Mining
This paper presents a variation of Apriori algorithm that includes the role of domain expert to guide and speed up the overall knowledge discovery task. Usually, the user is inter...
Vikram Singh, Sapna Nagpal
CN
2006
78views more  CN 2006»
13 years 7 months ago
CNPGSDP: An efficient group-based service discovery protocol for MANETs
The ability to discover services is the major prerequisite for effective usability of MANETs. Group-based Service Discovery (GSD) protocol is a typical service discovery protocol ...
Zhen-guo Gao, Ling Wang, Mei Yang, Xiaozong Yang