Sciweavers

CINQ
2004
Springer
133views Database» more  CINQ 2004»
13 years 10 months ago
Inductive Querying for Discovering Subgroups and Clusters
We introduce the problem of cluster-grouping and show that it integrates several important data mining tasks, i.e. subgroup discovery, mining correlated patterns and aspects from c...
Albrecht Zimmermann, Luc De Raedt
CINQ
2004
Springer
116views Database» more  CINQ 2004»
13 years 10 months ago
Contribution to Gene Expression Data Analysis by Means of Set Pattern Mining
Abstract. One of the exciting scientific challenges in functional genomics concerns the discovery of biologically relevant patterns from gene expression data. For instance, it is e...
Ruggero G. Pensa, Jérémy Besson, C&e...
CINQ
2004
Springer
157views Database» more  CINQ 2004»
13 years 10 months ago
Inductive Databases and Multiple Uses of Frequent Itemsets: The cInQ Approach
Inductive databases (IDBs) have been proposed to afford the problem of knowledge discovery from huge databases. With an IDB the user/analyst performs a set of very different operat...
Jean-François Boulicaut
CINQ
2004
Springer
182views Database» more  CINQ 2004»
13 years 10 months ago
Mining Constrained Graphs: The Case of Workflow Systems
Abstract. Constrained graphs are directed graphs describing the control flow of processes models. In such graphs, nodes represent activities involved in the process, and edges the ...
Gianluigi Greco, Antonella Guzzo, Giuseppe Manco, ...
CINQ
2004
Springer
180views Database» more  CINQ 2004»
13 years 10 months ago
Interactivity, Scalability and Resource Control for Efficient KDD Support in DBMS
The conflict between resource consumption and query performance in the data mining context often has no satisfactory solution. This not only stands in sharp contrast to the need of...
Matthias Gimbel, Michael Klein, Peter C. Lockemann
CINQ
2004
Springer
116views Database» more  CINQ 2004»
13 years 10 months ago
A Survey on Condensed Representations for Frequent Sets
Abstract. Solving inductive queries which have to return complete collections of patterns satisfying a given predicate has been studied extensively the last few years. The specific...
Toon Calders, Christophe Rigotti, Jean-Franç...
CINQ
2004
Springer
151views Database» more  CINQ 2004»
13 years 10 months ago
Query Languages Supporting Descriptive Rule Mining: A Comparative Study
Recently, inductive databases (IDBs) have been proposed to tackle the problem of knowledge discovery from huge databases. With an IDB, the user/analyst performs a set of very diffe...
Marco Botta, Jean-François Boulicaut, Cyril...
CINQ
2004
Springer
177views Database» more  CINQ 2004»
13 years 11 months ago
Generic Pattern Mining Via Data Mining Template Library
Frequent Pattern Mining (FPM) is a very powerful paradigm for mining informative and useful patterns in massive, complex datasets. In this paper we propose the Data Mining Templat...
Mohammed Javeed Zaki, Nilanjana De, Feng Gao, Paol...
CINQ
2004
Springer
123views Database» more  CINQ 2004»
13 years 11 months ago
One-Sided Instance-Based Boundary Sets
Abstract. Instance retraction is a difficult problem for concept learning by version spaces. This chapter introduces a family of version-space representations called one-sided inst...
Evgueni N. Smirnov, Ida G. Sprinkhuizen-Kuyper, H....
CINQ
2004
Springer
118views Database» more  CINQ 2004»
13 years 11 months ago
Boolean Formulas and Frequent Sets
We consider the problem of how one can estimate the support of Boolean queries given a collection of frequent itemsets. We describe an algorithm that truncates the inclusion-exclus...
Jouni K. Seppänen, Heikki Mannila