Sciweavers

86 search results - page 11 / 18
» Exploiting Context When Learning to Classify
Sort
View
DMIN
2006
114views Data Mining» more  DMIN 2006»
13 years 9 months ago
Towards Using Fewer Features for Text Classification
Abstract-- Text classification or categorization is a conventional classification problem applied to the text domain. In the cases when statistical classification methods are used,...
Yuan Yuan, Tianyang Gu
SAC
2005
ACM
14 years 1 months ago
Learning decision trees from dynamic data streams
: This paper presents a system for induction of forest of functional trees from data streams able to detect concept drift. The Ultra Fast Forest of Trees (UFFT) is an incremental a...
João Gama, Pedro Medas, Pedro Pereira Rodri...
EUROCAST
2007
Springer
182views Hardware» more  EUROCAST 2007»
14 years 1 months ago
A k-NN Based Perception Scheme for Reinforcement Learning
Abstract a paradigm of modern Machine Learning (ML) which uses rewards and punishments to guide the learning process. One of the central ideas of RL is learning by “direct-online...
José Antonio Martin H., Javier de Lope Asia...
KDD
2008
ACM
259views Data Mining» more  KDD 2008»
14 years 8 months ago
Using ghost edges for classification in sparsely labeled networks
We address the problem of classification in partially labeled networks (a.k.a. within-network classification) where observed class labels are sparse. Techniques for statistical re...
Brian Gallagher, Hanghang Tong, Tina Eliassi-Rad, ...
WSDM
2010
ACM
194views Data Mining» more  WSDM 2010»
14 years 5 months ago
Ranking with Query-Dependent Loss for Web Search
Queries describe the users' search intent and therefore they play an essential role in the context of ranking for information retrieval and Web search. However, most of exist...
Jiang Bian, Tie-Yan Liu, Tao Qin, Hongyuan Zha