Sciweavers

106 search results - page 2 / 22
» Finding Interesting Associations without Support Pruning
Sort
View
WEBNET
2000
13 years 6 months ago
Mining the Most Interesting Web Access Associations
: Web access patterns can provide valuable information for website designers in making website-based communication more efficient. To extract interesting or useful web access patte...
Li Shen, Ling Cheng, James Ford, Fillia Makedon, V...
RECOMB
2009
Springer
14 years 5 months ago
COE: A General Approach for Efficient Genome-Wide Two-Locus Epistasis Test in Disease Association Study
The availability of high density single nucleotide polymorphisms (SNPs) data has made genome-wide association study computationally challenging. Twolocus epistasis (gene-gene inter...
Xiang Zhang, Feng Pan, Yuying Xie, Fei Zou, Wei Wa...
KDD
2008
ACM
181views Data Mining» more  KDD 2008»
14 years 5 months ago
Fastanova: an efficient algorithm for genome-wide association study
Studying the association between quantitative phenotype (such as height or weight) and single nucleotide polymorphisms (SNPs) is an important problem in biology. To understand und...
Xiang Zhang, Fei Zou, Wei Wang 0010
JCIT
2008
128views more  JCIT 2008»
13 years 4 months ago
OPAM-An Efficient One Pass Association Mining Technique without Candidate Generation
This paper presents an efficient One Pass Association Mining technique i.e. OPAM, which finds all the frequent itemsets without generating any candidate sets. OPAM is basically an...
S. Roy, D. K. Bhattacharyya
ICDM
2009
IEEE
109views Data Mining» more  ICDM 2009»
13 years 11 months ago
Finding Associations and Computing Similarity via Biased Pair Sampling
Sampling-based methods have previously been proposed for the problem of finding interesting associations in data, even for low-support items. While these methods do not guarantee ...
Andrea Campagna, Rasmus Pagh