Sciweavers

119 search results - page 21 / 24
» Mining Closed Gradual Patterns
Sort
View
ICDM
2005
IEEE
125views Data Mining» more  ICDM 2005»
15 years 3 months ago
A Thorough Experimental Study of Datasets for Frequent Itemsets
The discovery of frequent patterns is a famous problem in data mining. While plenty of algorithms have been proposed during the last decade, only a few contributions have tried to...
Frédéric Flouvat, Fabien De Marchi, ...
SSD
2005
Springer
173views Database» more  SSD 2005»
15 years 3 months ago
On Discovering Moving Clusters in Spatio-temporal Data
A moving cluster is defined by a set of objects that move close to each other for a long time interval. Real-life examples are a group of migrating animals, a convoy of cars movin...
Panos Kalnis, Nikos Mamoulis, Spiridon Bakiras
JIIS
2010
106views more  JIIS 2010»
14 years 4 months ago
A new classification of datasets for frequent itemsets
The discovery of frequent patterns is a famous problem in data mining. While plenty of algorithms have been proposed during the last decade, only a few contributions have tried to ...
Frédéric Flouvat, Fabien De Marchi, ...
CIARP
2009
Springer
15 years 24 days ago
A Brief Index for Proximity Searching
A large number of computer tasks can be modeled as the search for an object near a given query. From multimedia databases to learning algorithms, data mining and pattern recognitio...
Eric Sadit Tellez, Edgar Chávez, Antonio Ca...
PKDD
2005
Springer
117views Data Mining» more  PKDD 2005»
15 years 3 months ago
A Bi-clustering Framework for Categorical Data
Bi-clustering is a promising conceptual clustering approach. Within categorical data, it provides a collection of (possibly overlapping) bi-clusters, i.e., linked clusters for both...
Ruggero G. Pensa, Céline Robardet, Jean-Fra...