Sciweavers

8728 search results - page 431 / 1746
» On Reduct Construction Algorithms
Sort
View
CORR
2010
Springer
145views Education» more  CORR 2010»
15 years 7 months ago
Random Indexing K-tree
Random Indexing K-tree is the combination of two algorithms suited for large scale document clustering. Keywords Random Indexing, K-tree, Dimensionality Reduction, B-tree, Search T...
Christopher M. De Vries, Lance De Vine, Shlomo Gev...
JACM
2006
99views more  JACM 2006»
15 years 6 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
PRL
2008
95views more  PRL 2008»
15 years 6 months ago
Semi-supervised learning by search of optimal target vector
We introduce a semi-supervised learning estimator which tends to the first kernel principal component as the number of labeled points vanishes. We show application of the proposed...
Leonardo Angelini, Daniele Marinazzo, Mario Pellic...
AMC
2005
112views more  AMC 2005»
15 years 6 months ago
Mechanization for solving SPP by reducing order method
In this paper, by using the theories and methods of mathematical analysis and computer algebra, a reliable algorithm of reduction of order approximation method for solving singula...
Zhenqing Li, Weiming Wang
FEGC
2009
86views Biometrics» more  FEGC 2009»
15 years 4 months ago
Binary Sequences and Association Graphs for Fast Detection of Sequential Patterns
We develop an efficient algorithm for detecting frequent patterns that occur in sequence databases under certain constraints. By combining the use of bit vector representations of ...
Selim Mimaroglu, Dan A. Simovici