Sciweavers

387 search results - page 20 / 78
» Mining Approximative Descriptions of Sets Using Rough Sets
Sort
View
FUIN
2002
108views more  FUIN 2002»
14 years 11 months ago
Approximate Entropy Reducts
We use information entropy measure to extend the rough set based notion of a reduct. We introduce the Approximate Entropy Reduction Principle (AERP). It states that any simplificat...
Dominik Slezak
CVPR
2004
IEEE
16 years 1 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Kristen Grauman, Trevor Darrell
SDM
2007
SIAM
126views Data Mining» more  SDM 2007»
15 years 1 months ago
Nonlinear Dimensionality Reduction using Approximate Nearest Neighbors
Nonlinear dimensionality reduction methods often rely on the nearest-neighbors graph to extract low-dimensional embeddings that reliably capture the underlying structure of high-d...
Erion Plaku, Lydia E. Kavraki
MICCAI
2006
Springer
16 years 21 days ago
The Entire Regularization Path for the Support Vector Domain Description
Abstract. The support vector domain description is a one-class classification method that estimates the shape and extent of the distribution of a data set. This separates the data ...
Karl Sjöstrand, Rasmus Larsen
FUIN
2007
123views more  FUIN 2007»
14 years 11 months ago
Analysis of Approximate Petri Nets by Means of Occurrence Graphs
Abstract. Approximate Petri nets (AP-nets) can be used for the knowledge representation and approximate reasoning. The AP-net model is defined on the basis of the rough set approa...
Zbigniew Suraj, Barbara Fryc