Sciweavers

1544 search results - page 34 / 309
» Data Mining and Database Systems: Where is the Intersection
Sort
View
ICDM
2007
IEEE
166views Data Mining» more  ICDM 2007»
14 years 1 months ago
Mining Statistical Information of Frequent Fault-Tolerant Patterns in Transactional Databases
Constraints applied on classic frequent patterns are too strict and may cause interesting patterns to be missed. Hence, researchers have proposed to mine a more relaxed version of...
Ardian Kristanto Poernomo, Vivekanand Gopalkrishna...
SDM
2008
SIAM
177views Data Mining» more  SDM 2008»
13 years 9 months ago
Robust Clustering in Arbitrarily Oriented Subspaces
In this paper, we propose an efficient and effective method to find arbitrarily oriented subspace clusters by mapping the data space to a parameter space defining the set of possi...
Elke Achtert, Christian Böhm, Jörn David...
PVLDB
2010
145views more  PVLDB 2010»
13 years 6 months ago
Keymantic: Semantic Keyword-based Searching in Data Integration Systems
We propose the demonstration of Keymantic, a system for keyword-based searching in relational databases that does not require a-priori knowledge of instances held in a database. I...
Sonia Bergamaschi, Elton Domnori, Francesco Guerra...
ADC
2006
Springer
169views Database» more  ADC 2006»
14 years 1 months ago
A further study in the data partitioning approach for frequent itemsets mining
Frequent itemsets mining is well explored for various data types, and its computational complexity is well understood. Based on our previous work by Nguyen and Orlowska (2005), th...
Son N. Nguyen, Maria E. Orlowska
KDD
2003
ACM
120views Data Mining» more  KDD 2003»
14 years 8 months ago
On detecting differences between groups
Understanding the differences between contrasting groups is a fundamental task in data analysis. This realization has led to the development of a new special purpose data mining t...
Geoffrey I. Webb, Shane M. Butler, Douglas A. Newl...