Sciweavers

4085 search results - page 431 / 817
» Benchmarking Data Mining Algorithms
Sort
View
CAP
2010
15 years 2 days ago
Parallel sparse polynomial division using heaps
We present a parallel algorithm for exact division of sparse distributed polynomials on a multicore processor. This is a problem with significant data dependencies, so our solutio...
Michael B. Monagan, Roman Pearce
ICDM
2010
IEEE
121views Data Mining» more  ICDM 2010»
15 years 3 months ago
Recommending Social Events from Mobile Phone Location Data
A city offers thousands of social events a day, and it is difficult for dwellers to make choices. The combination of mobile phones and recommender systems can change the way one de...
Daniele Quercia, Neal Lathia, Francesco Calabrese,...
KDD
2007
ACM
231views Data Mining» more  KDD 2007»
16 years 5 months ago
Xproj: a framework for projected structural clustering of xml documents
XML has become a popular method of data representation both on the web and in databases in recent years. One of the reasons for the popularity of XML has been its ability to encod...
Charu C. Aggarwal, Na Ta, Jianyong Wang, Jianhua F...
162
Voted
SDM
2003
SIAM
123views Data Mining» more  SDM 2003»
15 years 6 months ago
Fast Online SVD Revisions for Lightweight Recommender Systems
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
Matthew Brand
ICIP
2008
IEEE
16 years 6 months ago
Learning structurally discriminant features in 3D faces
In this paper, we derive a data mining framework to analyze 3D features on human faces. The framework leverages kernel density estimators, genetic algorithm and an information com...
Sreenivas R. Sukumar, Hamparsum Bozdogan, David L....