Sciweavers

1314 search results - page 5 / 263
» Approximate data mining in very large relational data
Sort
View
SIGMOD
1998
ACM
271views Database» more  SIGMOD 1998»
13 years 7 months ago
Towards On-Line Analytical Mining in Large Databases
Great e orts have been paid in the Intelligent Database Systems Research Lab for the research and development of e cient data mining methods and construction of on-line analytical...
Jiawei Han
SIGMOD
2000
ACM
212views Database» more  SIGMOD 2000»
13 years 11 months ago
SQLEM: Fast Clustering in SQL using the EM Algorithm
Clustering is one of the most important tasks performed in Data Mining applications. This paper presents an e cient SQL implementation of the EM algorithm to perform clustering in...
Carlos Ordonez, Paul Cereghini
CIKM
2009
Springer
14 years 1 months ago
Frequent subgraph pattern mining on uncertain graph data
Graph data are subject to uncertainties in many applications due to incompleteness and imprecision of data. Mining uncertain graph data is semantically different from and computat...
Zhaonian Zou, Jianzhong Li, Hong Gao, Shuo Zhang
ICDE
2008
IEEE
192views Database» more  ICDE 2008»
14 years 8 months ago
Verifying and Mining Frequent Patterns from Large Windows over Data Streams
Mining frequent itemsets from data streams has proved to be very difficult because of computational complexity and the need for real-time response. In this paper, we introduce a no...
Barzan Mozafari, Hetal Thakkar, Carlo Zaniolo
ICDM
2005
IEEE
139views Data Mining» more  ICDM 2005»
14 years 29 days ago
Approximate Inverse Frequent Itemset Mining: Privacy, Complexity, and Approximation
In order to generate synthetic basket data sets for better benchmark testing, it is important to integrate characteristics from real-life databases into the synthetic basket data ...
Yongge Wang, Xintao Wu