Sciweavers

3245 search results - page 463 / 649
» Mining Transformed Data Sets
Sort
View
CORR
2008
Springer
92views Education» more  CORR 2008»
15 years 6 months ago
Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees
Consider a set of labels L and a set of trees T = {T (1) , T (2) , . . . , T (k) } where each tree T (i) is distinctly leaf-labeled by some subset of L. One fundamental problem is ...
Viet Tung Hoang, Wing-Kin Sung
ICDE
1999
IEEE
183views Database» more  ICDE 1999»
16 years 7 months ago
ROCK: A Robust Clustering Algorithm for Categorical Attributes
Clustering, in data mining, is useful to discover distribution patterns in the underlying data. Clustering algorithms usually employ a distance metric based (e.g., euclidean) simi...
Sudipto Guha, Rajeev Rastogi, Kyuseok Shim
SDM
2009
SIAM
105views Data Mining» more  SDM 2009»
16 years 3 months ago
Exploiting Semantic Constraints for Estimating Supersenses with CRFs.
The annotation of words and phrases by ontology concepts is extremely helpful for semantic interpretation. However many ontologies, e.g. WordNet, are too fine-grained and even hu...
Gerhard Paaß, Frank Reichartz
ICIP
2006
IEEE
16 years 8 months ago
A Probabilistic Approach to Robust Shape Matching
We present a probabilistic approach to shape matching which is invariant to rotation, translation and scaling. Shapes are represented by unlabeled point sets, so discontinuous bou...
Graham McNeill, Sethu Vijayakumar
ICIP
2000
IEEE
16 years 8 months ago
On the Compression of Image Based Rendering Scene
In image based rendering (IBR), a 3D scene is recorded through a set of photos, and a novel view is rendered by assembling data from the photo set. Compression is essential to red...
Jin Li, Harry Shum, Ya-Qin Zhang