Sciweavers

12863 search results - page 976 / 2573
» Dynamic Data Mining
Sort
View
KDD
2006
ACM
136views Data Mining» more  KDD 2006»
16 years 8 months ago
Very sparse random projections
There has been considerable interest in random projections, an approximate algorithm for estimating distances between pairs of points in a high-dimensional vector space. Let A Rn...
Ping Li, Trevor Hastie, Kenneth Ward Church
KDD
2006
ACM
177views Data Mining» more  KDD 2006»
16 years 8 months ago
Topics over time: a non-Markov continuous-time model of topical trends
This paper presents an LDA-style topic model that captures not only the low-dimensional structure of data, but also how the structure changes over time. Unlike other recent work t...
Xuerui Wang, Andrew McCallum
KDD
2006
ACM
147views Data Mining» more  KDD 2006»
16 years 8 months ago
Summarizing itemset patterns using probabilistic models
In this paper, we propose a novel probabilistic approach to summarize frequent itemset patterns. Such techniques are useful for summarization, post-processing, and end-user interp...
Chao Wang, Srinivasan Parthasarathy
KDD
2004
ACM
158views Data Mining» more  KDD 2004»
16 years 8 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...
KDD
2004
ACM
150views Data Mining» more  KDD 2004»
16 years 8 months ago
Markov Blankets and Meta-heuristics Search: Sentiment Extraction from Unstructured Texts
Extracting sentiments from unstructured text has emerged as an important problem in many disciplines. An accurate method would enable us, for example, to mine online opinions from ...
Edoardo Airoldi, Xue Bai, Rema Padman