Sciweavers

2497 search results - page 354 / 500
» A Partial-Repeatability Approach to Data Mining
Sort
View
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
14 years 6 months ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon
SISAP
2011
IEEE
437views Data Mining» more  SISAP 2011»
14 years 6 months ago
Succinct nearest neighbor search
In this paper we present a novel technique for nearest neighbor searching dubbed neighborhood approximation. The central idea is to divide the database into compact regions repres...
Eric Sadit Tellez, Edgar Chávez, Gonzalo Na...
KDD
2009
ACM
210views Data Mining» more  KDD 2009»
16 years 4 months ago
Large-scale behavioral targeting
Behavioral targeting (BT) leverages historical user behavior to select the ads most relevant to users to display. The state-of-the-art of BT derives a linear Poisson regression mo...
Ye Chen, Dmitry Pavlov, John F. Canny
ESANN
2006
15 years 5 months ago
Data topology visualization for the Self-Organizing Map
The Self-Organizing map (SOM), a powerful method for data mining and cluster extraction, is very useful for processing data of high dimensionality and complexity. Visualization met...
Kadim Tasdemir, Erzsébet Merényi
KDD
1998
ACM
129views Data Mining» more  KDD 1998»
15 years 8 months ago
Data Reduction Based on Hyper Relations
Data reduction makes datasets smaller but preserves classication structures of interest. It is an important area of research in data mining and databases. In this paper we present...
Hui Wang, Ivo Düntsch, David A. Bell