Sciweavers

2150 search results - page 219 / 430
» On a restricted cross-intersection problem
Sort
View
JMLR
2002
144views more  JMLR 2002»
15 years 3 months ago
Round Robin Classification
In this paper, we discuss round robin classification (aka pairwise classification), a technique for handling multi-class problems with binary classifiers by learning one classifie...
Johannes Fürnkranz
133
Voted
JMLR
2002
83views more  JMLR 2002»
15 years 3 months ago
On Online Learning of Decision Lists
A fundamental open problem in computational learning theory is whether there is an attribute efficient learning algorithm for the concept class of decision lists (Rivest, 1987; Bl...
Ziv Nevo, Ran El-Yaniv
143
Voted
TMM
2002
104views more  TMM 2002»
15 years 3 months ago
Spatial contextual classification and prediction models for mining geospatial data
Modeling spatial context (e.g., autocorrelation) is a key challenge in classification problems that arise in geospatial domains. Markov random fields (MRF) is a popular model for i...
Shashi Shekhar, Paul R. Schrater, Ranga Raju Vatsa...
CIKM
2010
Springer
15 years 2 months ago
Finding unusual review patterns using unexpected rules
In recent years, opinion mining attracted a great deal of research attention. However, limited work has been done on detecting opinion spam (or fake reviews). The problem is analo...
Nitin Jindal, Bing Liu, Ee-Peng Lim
149
Voted
SIAMCOMP
2010
120views more  SIAMCOMP 2010»
15 years 2 months ago
Edge Disjoint Paths in Moderately Connected Graphs
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
Satish Rao, Shuheng Zhou