Sciweavers

128 search results - page 18 / 26
» On Mining Closed Sets in Multi-Relational Data
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, ...
DOLAP
2010
ACM
14 years 7 months ago
Relational versus non-relational database systems for data warehousing
Relational database systems have been the dominating technology to manage and analyze large data warehouses. Moreover, the ER model, the standard in database design, has a close r...
Carlos Ordonez, Il-Yeol Song, Carlos Garcia-Alvara...
IDA
2007
Springer
14 years 9 months ago
Anomaly detection in data represented as graphs
An important area of data mining is anomaly detection, particularly for fraud. However, little work has been done in terms of detecting anomalies in data that is represented as a g...
William Eberle, Lawrence B. Holder
PKDD
2000
Springer
107views Data Mining» more  PKDD 2000»
15 years 1 months ago
Expert Constrained Clustering: A Symbolic Approach
Abstract. A new constrained model is discussed as a way of incorporating efficiently a priori expert knowledge into a clustering problem of a given individual set. The first innova...
Fabrice Rossi, Frédérick Vautrain
ICDM
2010
IEEE
121views Data Mining» more  ICDM 2010»
14 years 7 months ago
Recommending Social Events from Mobile Phone Location Data
A city offers thousands of social events a day, and it is difficult for dwellers to make choices. The combination of mobile phones and recommender systems can change the way one de...
Daniele Quercia, Neal Lathia, Francesco Calabrese,...