Sciweavers

4544 search results - page 832 / 909
» Reinforcement Learning with Time
Sort
View
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
14 years 10 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
KDD
2005
ACM
192views Data Mining» more  KDD 2005»
14 years 10 months ago
Modeling and predicting personal information dissemination behavior
In this paper, we propose a new way to automatically model and predict human behavior of receiving and disseminating information by analyzing the contact and content of personal c...
Xiaodan Song, Ching-Yung Lin, Belle L. Tseng, Ming...
KDD
2004
ACM
154views Data Mining» more  KDD 2004»
14 years 10 months ago
Diagnosing extrapolation: tree-based density estimation
There has historically been very little concern with extrapolation in Machine Learning, yet extrapolation can be critical to diagnose. Predictor functions are almost always learne...
Giles Hooker
KDD
2004
ACM
135views Data Mining» more  KDD 2004»
14 years 10 months ago
Discovering additive structure in black box functions
Many automated learning procedures lack interpretability, operating effectively as a black box: providing a prediction tool but no explanation of the underlying dynamics that driv...
Giles Hooker
KDD
2004
ACM
209views Data Mining» more  KDD 2004»
14 years 10 months ago
Tracking dynamics of topic trends using a finite mixture model
In a wide range of business areas dealing with text data streams, including CRM, knowledge management, and Web monitoring services, it is an important issue to discover topic tren...
Satoshi Morinaga, Kenji Yamanishi