Sciweavers

822 search results - page 116 / 165
» Case Mining from Large Databases
Sort
View
KBS
2006
87views more  KBS 2006»
13 years 7 months ago
Predictive and comprehensible rule discovery using a multi-objective genetic algorithm
We present a multi-objective genetic algorithm for mining highly predictive and comprehensible classification rules from large databases. We emphasize predictive accuracy and comp...
Satchidananda Dehuri, Rajib Mall
SEMWEB
2010
Springer
13 years 5 months ago
Auto-experimentation of KDD Workflows Based on Ontological Planning
One of the problems of Knowledge Discovery in Databases (KDD) is the lack of user support for solving KDD problems. Current Data Mining (DM) systems enable the user to manually des...
Floarea Serban
KDD
2006
ACM
109views Data Mining» more  KDD 2006»
14 years 8 months ago
Extracting redundancy-aware top-k patterns
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...
Dong Xin, Hong Cheng, Xifeng Yan, Jiawei Han
DEXA
1998
Springer
140views Database» more  DEXA 1998»
14 years 3 days ago
An Analytical Study of Object Identifier Indexing
The object identifier index of an object-oriented database system is typically 20% of the size of the database itself, and for large databases, only a small part of the index fits...
Kjetil Nørvåg, Kjell Bratbergsengen
KDD
2012
ACM
194views Data Mining» more  KDD 2012»
11 years 10 months ago
A sparsity-inducing formulation for evolutionary co-clustering
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...
Shuiwang Ji, Wenlu Zhang, Jun Liu