Sciweavers

1314 search results - page 27 / 263
» Approximate data mining in very large relational data
Sort
View
STOC
2001
ACM
134views Algorithms» more  STOC 2001»
14 years 7 months ago
Data-streams and histograms
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
Sudipto Guha, Nick Koudas, Kyuseok Shim
LWA
2004
13 years 8 months ago
Efficient Frequent Pattern Mining in Relational Databases
Data mining on large relational databases has gained popularity and its significance is well recognized. However, the performance of SQL based data mining is known to fall behind ...
Xuequn Shang, Kai-Uwe Sattler, Ingolf Geist
TKDE
2012
253views Formal Methods» more  TKDE 2012»
11 years 9 months ago
Horizontal Aggregations in SQL to Prepare Data Sets for Data Mining Analysis
—Preparing a data set for analysis is generally the most time consuming task in a data mining project, requiring many complex SQL queries, joining tables and aggregating columns....
Carlos Ordonez, Zhibo Chen 0002
KDD
2005
ACM
127views Data Mining» more  KDD 2005»
14 years 28 days ago
Mining closed relational graphs with connectivity constraints
Relational graphs are widely used in modeling large scale networks such as biological networks and social networks. In this kind of graph, connectivity becomes critical in identif...
Xifeng Yan, Xianghong Jasmine Zhou, Jiawei Han
BTW
2009
Springer
240views Database» more  BTW 2009»
13 years 8 months ago
Efficient Adaptive Retrieval and Mining in Large Multimedia Databases
Abstract: Multimedia databases are increasingly common in science, business, entertainment and many other applications. Their size and high dimensionality of features are major cha...
Ira Assent