Sciweavers

63 search results - page 12 / 13
» Rough Sets in Spatio-temporal Data Mining
Sort
View
PAKDD
2009
ACM
186views Data Mining» more  PAKDD 2009»
14 years 23 days ago
Pairwise Constrained Clustering for Sparse and High Dimensional Feature Spaces
Abstract. Clustering high dimensional data with sparse features is challenging because pairwise distances between data items are not informative in high dimensional space. To addre...
Su Yan, Hai Wang, Dongwon Lee, C. Lee Giles
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
13 years 3 months ago
Complexity Bounds for Batch Active Learning in Classification
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
Philippe Rolet, Olivier Teytaud
KDD
2000
ACM
114views Data Mining» more  KDD 2000»
13 years 9 months ago
Learning Prosodic Patterns for Mandarin Speech Synthesis
Higher quality synthesized speech is required for widespread use of text-to-speech (TTS) technology, and prosodic pattern is the key feature that makes synthetic speech sound unna...
Yiqiang Chen, Wen Gao, Tingshao Zhu
WSDM
2012
ACM
262views Data Mining» more  WSDM 2012»
12 years 1 months ago
Effects of user similarity in social media
There are many settings in which users of a social media application provide evaluations of one another. In a variety of domains, mechanisms for evaluation allow one user to say w...
Ashton Anderson, Daniel P. Huttenlocher, Jon M. Kl...
IPL
2007
96views more  IPL 2007»
13 years 5 months ago
On constructing an optimal consensus clustering from multiple clusterings
Computing a suitable measure of consensus among several clusterings on the same data is an important problem that arises in several areas such as computational biology and data mi...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao, Jie...