Sciweavers

88 search results - page 14 / 18
» Further Pruning for Efficient Association Rule Discovery
Sort
View
BMCBI
2010
88views more  BMCBI 2010»
13 years 7 months ago
FastTagger: an efficient algorithm for genome-wide tag SNP selection using multi-marker linkage disequilibrium
Background: Human genome contains millions of common single nucleotide polymorphisms (SNPs) and these SNPs play an important role in understanding the association between genetic ...
Guimei Liu, Yue Wang, Limsoon Wong
FSKD
2005
Springer
90views Fuzzy Logic» more  FSKD 2005»
14 years 1 months ago
Direct Candidates Generation: A Novel Algorithm for Discovering Complete Share-Frequent Itemsets
The value of the itemset share is one way of evaluating the magnitude of an itemset. From business perspective, itemset share values reflect more the significance of itemsets for m...
Yu-Chiang Li, Jieh-Shan Yeh, Chin-Chen Chang
WWW
2009
ACM
14 years 8 months ago
Collaborative filtering for orkut communities: discovery of user latent behavior
Users of social networking services can connect with each other by forming communities for online interaction. Yet as the number of communities hosted by such websites grows over ...
WenYen Chen, Jon-Chyuan Chu, Junyi Luan, Hongjie B...
JMLR
2008
117views more  JMLR 2008»
13 years 7 months ago
Closed Sets for Labeled Data
Closed sets have been proven successful in the context of compacted data representation for association rule learning. However, their use is mainly descriptive, dealing only with ...
Gemma C. Garriga, Petra Kralj, Nada Lavrac
ADC
2003
Springer
182views Database» more  ADC 2003»
14 years 23 days ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
Yudho Giri Sucahyo, Raj P. Gopalan