Sciweavers

164 search results - page 26 / 33
» Constraint-based Tree Pattern Mining
Sort
View
RCIS
2010
14 years 10 months ago
A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
Jia-Ling Koh, Yi-Lang Tu
DMIN
2006
137views Data Mining» more  DMIN 2006»
15 years 1 months ago
Discovering of Frequent Itemsets with CP-mine Algorithm
Efficient algorithms to discover frequent patterns are crucial in data mining research. Several effective data structures, such as two-dimensional arrays, graphs, trees, and tries ...
Nuansri Denwattana, Yutthana Treewai
DASFAA
2005
IEEE
166views Database» more  DASFAA 2005»
15 years 5 months ago
NNF: An Effective Approach in Medicine Paring Analysis of Traditional Chinese Medicine Prescriptions
Medicine Paring Analysis is one of the most important tasks in the research of Traditional Chinese Medicine Prescriptions. The most essential and difficult step is to mine associat...
Chuan Li, Changjie Tang, Jing Peng, Jianjun Hu, Yo...
KDD
2001
ACM
124views Data Mining» more  KDD 2001»
16 years 9 hour ago
Tri-plots: scalable tools for multidimensional data mining
We focus on the problem of finding patterns across two large, multidimensional datasets. For example, given feature vectors of healthy and of non-healthy patients, we want to answ...
Agma J. M. Traina, Caetano Traina Jr., Spiros Papa...
SDM
2008
SIAM
118views Data Mining» more  SDM 2008»
15 years 1 months ago
Massive-Scale Kernel Discriminant Analysis: Mining for Quasars
We describe a fast algorithm for kernel discriminant analysis, empirically demonstrating asymptotic speed-up over the previous best approach. We achieve this with a new pattern of...
Ryan Riegel, Alexander Gray, Gordon Richards