Sciweavers

728 search results - page 30 / 146
» Mining for Empty Rectangles in Large Data Sets
Sort
View
DAWAK
2003
Springer
14 years 28 days ago
Handling Large Workloads by Profiling and Clustering
View materialization is recognized to be one of the most effective ways to increase the Data Warehouse performance; nevertheless, due to the computational complexity of the techniq...
Matteo Golfarelli
MADNES
2005
Springer
14 years 1 months ago
Distributed Data Mining Protocols for Privacy: A Review of Some Recent Results
With the rapid advance of the Internet, a large amount of sensitive data is collected, stored, and processed by different parties. Data mining is a powerful tool that can extract ...
Rebecca N. Wright, Zhiqiang Yang, Sheng Zhong
VLDB
1990
ACM
179views Database» more  VLDB 1990»
13 years 11 months ago
On Indexing Line Segments
In several image applications, it is necessary to retrieve specific line segments born a potentially very large set. In this paper, we consider the problem of indexing straight li...
H. V. Jagadish
DATAMINE
1999
140views more  DATAMINE 1999»
13 years 7 months ago
A Scalable Parallel Algorithm for Self-Organizing Maps with Applications to Sparse Data Mining Problems
Abstract. We describe a scalable parallel implementation of the self organizing map (SOM) suitable for datamining applications involving clustering or segmentation against large da...
Richard D. Lawrence, George S. Almasi, Holly E. Ru...
WSDM
2012
ACM
329views Data Mining» more  WSDM 2012»
12 years 3 months ago
Beyond 100 million entities: large-scale blocking-based resolution for heterogeneous data
A prerequisite for leveraging the vast amount of data available on the Web is Entity Resolution, i.e., the process of identifying and linking data that describe the same real-worl...
George Papadakis, Ekaterini Ioannou, Claudia Niede...