Sciweavers

1299 search results - page 146 / 260
» Computing Minimal Diagnoses with Critical Set Algorithms
Sort
View
ICDM
2010
IEEE
216views Data Mining» more  ICDM 2010»
14 years 7 months ago
K-AP: Generating Specified K Clusters by Efficient Affinity Propagation
Abstract--The Affinity Propagation (AP) clustering algorithm proposed by Frey and Dueck (2007) provides an understandable, nearly optimal summary of a data set. However, it suffers...
Xiangliang Zhang, Wei Wang, Kjetil Nørv&ari...
3DIM
2001
IEEE
15 years 1 months ago
Combining Off- and On-Line Calibration of a Digital Camera
We introduce a novel outlook on the self-calibration task, by considering images taken by a camera in motion, allowing for zooming and focusing. Apart from the complex relationshi...
Magdalena Urbanek, Radu Horaud, Peter F. Sturm
ECML
2006
Springer
15 years 1 months ago
Cost-Sensitive Decision Tree Learning for Forensic Classification
Abstract. In some learning settings, the cost of acquiring features for classification must be paid up front, before the classifier is evaluated. In this paper, we introduce the fo...
Jason V. Davis, Jungwoo Ha, Christopher J. Rossbac...
ADHOCNOW
2005
Springer
15 years 3 months ago
Cache Placement in Sensor Networks Under Update Cost Constraint
— In this paper, we address an optimization problem that arises in context of cache placement in sensor networks. In particular, we consider the cache placement problem where the...
Bin Tang, Samir R. Das, Himanshu Gupta
ICDM
2002
IEEE
153views Data Mining» more  ICDM 2002»
15 years 2 months ago
Generating an informative cover for association rules
Mining association rules may generate a large numbers of rules making the results hard to analyze manually. Pasquier et al. have discussed the generation of GuiguesDuquenne–Luxe...
Laurentiu Cristofor, Dan A. Simovici