Sciweavers

125 search results - page 19 / 25
» An efficient algorithm for incremental mining of temporal as...
Sort
View
DKE
2002
218views more  DKE 2002»
13 years 7 months ago
Computing iceberg concept lattices with T
We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suit...
Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas P...
RCIS
2010
13 years 6 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
ECAI
2008
Springer
13 years 9 months ago
A Practical Temporal Constraint Management System for Real-Time Applications
A temporal constraint management system (TCMS) is a temporal network together with algorithms for managing the constraints in that network over time. This paper presents a practica...
Luke Hunsberger
KDD
1995
ACM
67views Data Mining» more  KDD 1995»
13 years 11 months ago
A Perspective on Databases and Data Mining
We discuss the use of database met hods for data mining. Recently impressive results have been achieved for some data mining problems using highly specialized and clever data stru...
Marcel Holsheimer, Martin L. Kersten, Heikki Manni...
ICDE
2008
IEEE
120views Database» more  ICDE 2008»
14 years 9 months ago
Direct Discriminative Pattern Mining for Effective Classification
The application of frequent patterns in classification has demonstrated its power in recent studies. It often adopts a two-step approach: frequent pattern (or classification rule) ...
Hong Cheng, Xifeng Yan, Jiawei Han, Philip S. Yu