Sciweavers

962 search results - page 46 / 193
» Some Reducibilities on Regular Sets
Sort
View
DAM
2006
63views more  DAM 2006»
13 years 7 months ago
A new family of proximity graphs: Class cover catch digraphs
Motivated by issues in machine learning and statistical pattern classification, we investigate a class cover problem (CCP) with an associated family of directed graphs--class cove...
Jason DeVinney, Carey E. Priebe
COMBINATORICS
1998
84views more  COMBINATORICS 1998»
13 years 7 months ago
Multimatroids II. Orthogonality, minors and connectivity
A multimatroid is a combinatorial structure that encompasses matroids, delta-matroids and isotropic systems. This structure has been introduced to unify a theorem of Edmonds on th...
André Bouchet
ICAISC
2004
Springer
14 years 1 months ago
Comparison of Instances Seletion Algorithms I. Algorithms Survey
Abstract. Several methods were proposed to reduce the number of instances (vectors) in the learning set. Some of them extract only bad vectors while others try to remove as many in...
Norbert Jankowski, Marek Grochowski
WEBI
2005
Springer
14 years 1 months ago
A Semi-Supervised Document Clustering Algorithm Based on EM
Document clustering is a very hard task in Automatic Text Processing since it requires to extract regular patterns from a document collection without a priori knowledge on the cat...
Leonardo Rigutini, Marco Maggini
SISAP
2008
IEEE
98views Data Mining» more  SISAP 2008»
14 years 2 months ago
On Reinsertions in M-tree
In this paper we introduce a new M-tree building method, utilizing the classic idea of forced reinsertions. In case a leaf is about to split, some distant objects are removed from...
Jakub Lokoc, Tomás Skopal