Sciweavers

Share
KDID
2004
137views Database» more  KDID 2004»
9 years 2 months ago
Condensed Representation of EPs and Patterns Quantified by Frequency-Based Measures
Emerging patterns (EPs) are associations of features whose frequencies increase significantly from one class to another. They have been proven useful to build powerful classifiers ...
Arnaud Soulet, Bruno Crémilleux, Fran&ccedi...
KDID
2004
481views Database» more  KDID 2004»
9 years 2 months ago
Models and Indices for Integrating Unstructured Data with a Relational Database
Abstract. Database systems are islands of structure in a sea of unstructured data sources. Several real-world applications now need to create bridges for smooth integration of semi...
Sunita Sarawagi
KDID
2004
127views Database» more  KDID 2004»
9 years 2 months ago
Implicit Enumeration of Patterns
Condensed representations of pattern collections have been recognized to be important building blocks of inductive databases, a promising theoretical framework for data mining, and...
Taneli Mielikäinen
KDID
2004
132views Database» more  KDID 2004»
9 years 2 months ago
An Automata Approach to Pattern Collections
Condensed representations of pattern collections have been recognized to be important building blocks of inductive databases, a promising theoretical framework for data mining, and...
Taneli Mielikäinen
KDID
2004
149views Database» more  KDID 2004»
9 years 2 months ago
Database Transposition for Constrained (Closed) Pattern Mining
Abstract. Recently, different works proposed a new way to mine patterns in databases with pathological size. For example, experiments in genome biology usually provide databases wi...
Baptiste Jeudy, François Rioult
KDID
2004
134views Database» more  KDID 2004»
9 years 2 months ago
Theoretical Bounds on the Size of Condensed Representations
Abstract. Recent studies demonstrate the usefulness of condensed representations as a semantic compression technique for the frequent itemsets. Especially in inductive databases, c...
Nele Dexters, Toon Calders
KDID
2004
140views Database» more  KDID 2004»
9 years 2 months ago
Mining Formal Concepts with a Bounded Number of Exceptions from Transactional Data
We are designing new data mining techniques on boolean contexts to identify a priori interesting bi-sets (i.e., sets of objects or transactions associated to sets of attributes or ...
Jérémy Besson, Céline Robarde...
KDID
2004
121views Database» more  KDID 2004»
9 years 2 months ago
Constraint Relaxations for Discovering Unknown Sequential Patterns
The main drawbacks of sequential pattern mining have been its lack of focus on user expectations and the high number of discovered patterns. However, the solution commonly accepted...
Cláudia Antunes, Arlindo L. Oliveira
books