Sciweavers

2049 search results - page 250 / 410
» Privacy-Preserving Data Mining Systems
Sort
View
KDD
2004
ACM
158views Data Mining» more  KDD 2004»
15 years 11 months ago
A generalized maximum entropy approach to bregman co-clustering and matrix approximation
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
Arindam Banerjee, Inderjit S. Dhillon, Joydeep Gho...
ICDM
2009
IEEE
117views Data Mining» more  ICDM 2009»
15 years 6 months ago
Redistricting Using Heuristic-Based Polygonal Clustering
— Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too comple...
Deepti Joshi, Leen-Kiat Soh, Ashok Samal
ICDM
2007
IEEE
276views Data Mining» more  ICDM 2007»
15 years 5 months ago
SOPS: Stock Prediction Using Web Sentiment
Recently, the web has rapidly emerged as a great source of financial information ranging from news articles to personal opinions. Data mining and analysis of such financial info...
Vivek Sehgal, Charles Song
KDD
2010
ACM
287views Data Mining» more  KDD 2010»
15 years 1 months ago
Designing efficient cascaded classifiers: tradeoff between accuracy and cost
We propose a method to train a cascade of classifiers by simultaneously optimizing all its stages. The approach relies on the idea of optimizing soft cascades. In particular, inst...
Vikas C. Raykar, Balaji Krishnapuram, Shipeng Yu
SDM
2007
SIAM
201views Data Mining» more  SDM 2007»
15 years 25 days ago
Fast Best-Match Shape Searching in Rotation Invariant Metric Spaces
Object recognition and content-based image retrieval systems rely heavily on the accurate and efficient identification of shapes. A fundamental requirement in the shape analysis ...
Dragomir Yankov, Eamonn J. Keogh, Li Wei, Xiaopeng...