Sciweavers

8614 search results - page 125 / 1723
» Mining
Sort
View
KDD
2005
ACM
139views Data Mining» more  KDD 2005»
14 years 8 months ago
Reasoning about sets using redescription mining
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
Mohammed Javeed Zaki, Naren Ramakrishnan
KDD
2004
ACM
207views Data Mining» more  KDD 2004»
14 years 8 months ago
SPIN: mining maximal frequent subgraphs from graph databases
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...
Jun Huan, Wei Wang 0010, Jan Prins, Jiong Yang
KDD
2002
ACM
144views Data Mining» more  KDD 2002»
14 years 8 months ago
Efficiently mining frequent trees in a forest
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. We formulate the problem of mining (embedded) subtrees in ...
Mohammed Javeed Zaki
KDD
2009
ACM
347views Data Mining» more  KDD 2009»
14 years 3 months ago
FpViz: a visualizer for frequent pattern mining
Over the past 15 years, numerous algorithms have been proposed for frequent pattern mining as it plays an essential role in many knowledge discovery and data mining (KDD) tasks. M...
Carson Kai-Sang Leung, Christopher L. Carmichael
PAKDD
2007
ACM
121views Data Mining» more  PAKDD 2007»
14 years 2 months ago
Two-Phase Algorithms for a Novel Utility-Frequent Mining Model
When companies seek for the combination of products which can constantly generate high profit, the association rule mining (ARM) or the utility mining will not achieve such task. ...
Jieh-Shan Yeh, Yu-Chiang Li, Chin-Chen Chang