Sciweavers

1096 search results - page 19 / 220
» Evaluating Algorithms for Concept Description
Sort
View
AICOM
2006
124views more  AICOM 2006»
13 years 9 months ago
A Compact Representation for Least Common Subsumers in the description logic ALE
This paper introduces a compact representation which helps to avoid the exponential blow-up in space of the Least Common Subsumer (lcs) of two ALEconcept descriptions. Based on th...
Chan Le Duc, Nhan Le Thanh, Marie-Christine Rousse...
WACV
2005
IEEE
14 years 2 months ago
Ensemble Methods in the Clustering of String Patterns
We address the problem of clustering of contour images from hardware tools based on string descriptions, in a comparative study of cluster combination techniques. Several clusteri...
André Lourenço, Ana L. N. Fred
ICFHR
2010
194views Biometrics» more  ICFHR 2010»
13 years 3 months ago
ICFHR 2010 Contest: Quantitative Evaluation of Binarization Algorithms
This paper describes the ICFHR 2010 Contest for quantitative evaluation of binarization algorithms. These algorithm are applied to synthetic images of modern pdf documents with noi...
Roberto Paredes, Ergina Kavallieratou, Rafael Duei...
FUZZIEEE
2007
IEEE
14 years 3 months ago
A Fuzzy Description Logic with Product T-norm
— Fuzzy Description Logics (fuzzy DLs) have been proposed as a language to describe structured knowledge with vague concepts. It is well known that the choice of the fuzzy operat...
Fernando Bobillo, Umberto Straccia
IDA
2005
Springer
14 years 2 months ago
Condensed Nearest Neighbor Data Domain Description
—A simple yet effective unsupervised classification rule to discriminate between normal and abnormal data is based on accepting test objects whose nearest neighbors’ distances ...
Fabrizio Angiulli