Sciweavers

PAKDD
2004
ACM
94views Data Mining» more  PAKDD 2004»
14 years 2 months ago
Towards Optimizing Conjunctive Inductive Queries
Inductive queries are queries to an inductive database that generate a set of patterns in a data mining context. Inductive querying poses new challenges to database and data mining...
Johannes Fischer, Luc De Raedt
PAKDD
2004
ACM
199views Data Mining» more  PAKDD 2004»
14 years 2 months ago
Temporal Sequence Associations for Rare Events
In many real world applications, systematic analysis of rare events, such as credit card frauds and adverse drug reactions, is very important. Their low occurrence rate in large da...
Jie Chen, Hongxing He, Graham J. Williams, Huidong...
PAKDD
2004
ACM
186views Data Mining» more  PAKDD 2004»
14 years 2 months ago
CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees
Abstract. Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. One important problem in ...
Yun Chi, Yirong Yang, Yi Xia, Richard R. Muntz
PAKDD
2004
ACM
164views Data Mining» more  PAKDD 2004»
14 years 2 months ago
FP-Bonsai: The Art of Growing and Pruning Small FP-Trees
Abstract. In the context of mining frequent itemsets, numerous strategies have been proposed to push several types of constraints within the most well known algorithms. In this pap...
Francesco Bonchi, Bart Goethals
PAKDD
2004
ACM
117views Data Mining» more  PAKDD 2004»
14 years 2 months ago
Constraint-Based Mining of Formal Concepts in Transactional Data
We are designing new data mining techniques on boolean contexts to identify a priori interesting concepts, i.e., closed sets of objects (or transactions) and associated closed sets...
Jérémy Besson, Céline Robarde...
PAKDD
2004
ACM
94views Data Mining» more  PAKDD 2004»
14 years 2 months ago
Self-Similar Mining of Time Association Rules
Although the task of mining association rules has received considerable attention in the literature, algorithms to find time association rules are often inadequate, by either miss...
Daniel Barbará, Ping Chen, Zohreh Nazeri
PAKDD
2004
ACM
137views Data Mining» more  PAKDD 2004»
14 years 2 months ago
Fast and Light Boosting for Adaptive Mining of Data Streams
Supporting continuous mining queries on data streams requires algorithms that (i) are fast, (ii) make light demands on memory resources, and (iii) are easily to adapt to concept dr...
Fang Chu, Carlo Zaniolo
OOPSLA
2004
Springer
14 years 2 months ago
A framework for detecting, assessing and visualizing performance antipatterns in component based systems
Component-based enterprise systems often suffer from performance issues as a result of poor system design. In this paper, we propose a framework to automatically detect, assess an...
Trevor Parsons
KES
2004
Springer
14 years 2 months ago
A Comparison of Two Approaches to Data Mining from Imbalanced Data
Our objective is a comparison of two data mining approaches to dealing with imbalanced data sets. The first approach is based on saving the original rule set, induced by the LEM2 ...
Jerzy W. Grzymala-Busse, Jerzy Stefanowski, Szymon...
KDD
2004
ACM
173views Data Mining» more  KDD 2004»
14 years 2 months ago
Collaborative Quality Filtering: Establishing Consensus or Recovering Ground Truth?
We present a algorithm based on factor analysis for performing collaborative quality filtering (CQF). Unlike previous approaches to CQF, which estimate the consensus opinion of a...
Jonathan Traupman, Robert Wilensky