Sciweavers

1760 search results - page 26 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
AISADM
2005
Springer
14 years 1 months ago
A Cooperative Multi-agent Data Mining Model and Its Application to Medical Data on Diabetes
Abstract. We present CoLe, a model for cooperative agents for mining knowledge from heterogeneous data. CoLe allows for the cooperation of different mining agents and the combinat...
Jie Gao, Jörg Denzinger, Robert C. James
CVPR
2008
IEEE
14 years 2 months ago
Manifold-Manifold Distance with application to face recognition based on image set
In this paper, we address the problem of classifying image sets, each of which contains images belonging to the same class but covering large variations in, for instance, viewpoin...
Ruiping Wang, Shiguang Shan, Xilin Chen, Wen Gao
COMPGEOM
2006
ACM
14 years 1 months ago
Minimum-cost coverage of point sets by disks
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
Helmut Alt, Esther M. Arkin, Hervé Brö...
IPCO
2007
77views Optimization» more  IPCO 2007»
13 years 9 months ago
Mixed-Integer Vertex Covers on Bipartite Graphs
Let A be the edge-node incidence matrix of a bipartite graph G = (U, V ; E), I be a subset the nodes of G, and b be a vector such that 2b is integral. We consider the following mi...
Michele Conforti, Bert Gerards, Giacomo Zambelli
KDD
2009
ACM
228views Data Mining» more  KDD 2009»
14 years 8 months ago
A generalized Co-HITS algorithm and its application to bipartite graphs
Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...
Hongbo Deng, Michael R. Lyu, Irwin King