Sciweavers

2932 search results - page 98 / 587
» Higher order mining
Sort
View
109
Voted
KDD
1994
ACM
104views Data Mining» more  KDD 1994»
15 years 9 months ago
Dynamic Generation and Refinement of Concept Hierarchies for Knowledge Discovery in Databases
Concepthierarchies organizedata andconceptsin hierarchical ]ormsor in certain partial order, which helps expressingknowledgeanddata relationships in databasesin concise, highlevel...
Jiawei Han, Yongjian Fu
KDD
2004
ACM
207views Data Mining» more  KDD 2004»
16 years 5 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»
16 years 5 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
PAKDD
2007
ACM
121views Data Mining» more  PAKDD 2007»
15 years 11 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
LSO
2001
Springer
15 years 9 months ago
Knowledge Elicitation through Web-Based Data Mining Services
Knowledge is a vital component for organisational growth and data mining provides the technological basis for automated knowledge elicitation from data sources. The emergence of Ap...
Shonali Krishnaswamy, Seng Wai Loke, Arkady B. Zas...