Sciweavers

359 search results - page 36 / 72
» Solving Geometric Covering Problems by Data Reduction
Sort
View
ICDM
2010
IEEE
109views Data Mining» more  ICDM 2010»
13 years 7 months ago
Term Filtering with Bounded Error
Abstract--In this paper, we consider a novel problem referred to as term filtering with bounded error to reduce the term (feature) space by eliminating terms without (or with bound...
Zi Yang, Wei Li, Jie Tang, Juanzi Li
ICDM
2007
IEEE
148views Data Mining» more  ICDM 2007»
14 years 26 days ago
Sample Selection for Maximal Diversity
The problem of selecting a sample subset sufficient to preserve diversity arises in many applications. One example is in the design of recombinant inbred lines (RIL) for genetic a...
Feng Pan, Adam Roberts, Leonard McMillan, David Th...
CORR
2011
Springer
208views Education» more  CORR 2011»
13 years 4 months ago
GRASP and path-relinking for Coalition Structure Generation
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a soci...
Nicola Di Mauro, Teresa Maria Altomare Basile, Ste...
GRC
2008
IEEE
13 years 10 months ago
Neighborhood Smoothing Embedding for Noisy Manifold Learning
Manifold learning can discover the structure of high dimensional data and provides understanding of multidimensional patterns by preserving the local geometric characteristics. Ho...
Guisheng Chen, Junsong Yin, Deyi Li
CORR
2011
Springer
243views Education» more  CORR 2011»
13 years 4 months ago
Localization from Incomplete Noisy Distance Measurements
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
Adel Javanmard, Andrea Montanari