Sciweavers

1083 search results - page 80 / 217
» Efficient Discovery of Confounders in Large Data Sets
Sort
View
CIKM
2008
Springer
15 years 8 months ago
On effective presentation of graph patterns: a structural representative approach
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
Chen Chen, Cindy Xide Lin, Xifeng Yan, Jiawei Han
SIGMOD
2006
ACM
125views Database» more  SIGMOD 2006»
16 years 6 months ago
A non-linear dimensionality-reduction technique for fast similarity search in large databases
To enable efficient similarity search in large databases, many indexing techniques use a linear transformation scheme to reduce dimensions and allow fast approximation. In this re...
Khanh Vu, Kien A. Hua, Hao Cheng, Sheau-Dong Lang
ISBRA
2007
Springer
16 years 12 days ago
Clustering Algorithms Optimizer: A Framework for Large Datasets
Clustering algorithms are employed in many bioinformatics tasks, including categorization of protein sequences and analysis of gene-expression data. Although these algorithms are r...
Roy Varshavsky, David Horn, Michal Linial
CIKM
2009
Springer
15 years 4 months ago
Diverging patterns: discovering significant frequency change dissimilarities in large databases
In this paper, we present a framework for mining diverging patterns, a new type of contrast patterns whose frequency changes significantly differently in two data sets, e.g., it c...
Aijun An, Qian Wan, Jiashu Zhao, Xiangji Huang
KDD
1998
ACM
148views Data Mining» more  KDD 1998»
15 years 10 months ago
Group Bitmap Index: A Structure for Association Rules Retrieval
Discovery of association rules from large databases of item sets is an important data mining problem. Association rules are usually stored in relational databases for future use i...
Tadeusz Morzy, Maciej Zakrzewicz