Sciweavers

1214 search results - page 74 / 243
» Labeling Points with Weights
Sort
View
HEURISTICS
1998
103views more  HEURISTICS 1998»
15 years 5 months ago
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
Mauricio G. C. Resende
ICML
2007
IEEE
16 years 7 months ago
What is decreased by the max-sum arc consistency algorithm?
Inference tasks in Markov random fields (MRFs) are closely related to the constraint satisfaction problem (CSP) and its soft generalizations. In particular, MAP inference in MRF i...
Tomás Werner
PKDD
2009
Springer
117views Data Mining» more  PKDD 2009»
16 years 22 days ago
New Regularized Algorithms for Transductive Learning
Abstract. We propose a new graph-based label propagation algorithm for transductive learning. Each example is associated with a vertex in an undirected graph and a weighted edge be...
Partha Pratim Talukdar, Koby Crammer
175
Voted
MDM
2010
Springer
209views Communications» more  MDM 2010»
15 years 11 months ago
An Interactive-Voting Based Map Matching Algorithm
—Matching a raw GPS trajectory to roads on a digital map is often referred to as the Map Matching problem. However, the occurrence of the low-sampling-rate trajectories (e.g. one...
Jing Yuan, Yu Zheng, Chengyang Zhang, Xing Xie, Gu...
PAKDD
2010
ACM
165views Data Mining» more  PAKDD 2010»
15 years 8 months ago
Classification and Novel Class Detection in Data Streams with Active Mining
We present ActMiner, which addresses four major challenges to data stream classification, namely, infinite length, concept-drift, conceptevolution, and limited labeled data. Most o...
Mohammad M. Masud, Jing Gao, Latifur Khan, Jiawei ...