Sciweavers

942 search results - page 36 / 189
» Efficiently Mining Long Patterns from Databases
Sort
View
AUSDM
2007
Springer
131views Data Mining» more  AUSDM 2007»
15 years 3 months ago
A Bottom-Up Projection Based Algorithm for Mining High Utility Itemsets
Mining High Utility Itemsets from a transaction database is to find itemsests that have utility above a user-specified threshold. This problem is an extension of Frequent Itemset ...
Alva Erwin, Raj P. Gopalan, N. R. Achuthan
KDD
2008
ACM
239views Data Mining» more  KDD 2008»
15 years 10 months ago
Mining adaptively frequent closed unlabeled rooted trees in data streams
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
Albert Bifet, Ricard Gavaldà
ACIIDS
2009
IEEE
162views Database» more  ACIIDS 2009»
15 years 2 months ago
Deriving Conceptual Schema from XML Databases
In this paper, two concepts from different research areas are addressed together, namely functional dependency (FD) and multidimensional association rule (MAR). FD is a class of i...
Oviliani Yenty Yuliana, Suphamit Chittayasothorn
82
Voted
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
PKDD
1998
Springer
123views Data Mining» more  PKDD 1998»
15 years 1 months ago
Querying Inductive Databases: A Case Study on the MINE RULE Operator
Knowledge discovery in databases (KDD) is a process that can include steps like forming the data set, data transformations, discovery of patterns, searching for exceptions to a pat...
Jean-François Boulicaut, Mika Klemettinen, ...