Sciweavers

2229 search results - page 74 / 446
» Comparative analysis of biclustering algorithms
Sort
View
KDD
2001
ACM
216views Data Mining» more  KDD 2001»
16 years 8 days ago
Real world performance of association rule algorithms
This study compares five well-known association rule algorithms using three real-world datasets and an artificial dataset. The experimental results confirm the performance improve...
Zijian Zheng, Ron Kohavi, Llew Mason
COLT
1998
Springer
15 years 4 months ago
Improved Boosting Algorithms using Confidence-Rated Predictions
Abstract. We describe several improvements to Freund and Schapire's AdaBoost boosting algorithm, particularly in a setting in which hypotheses may assign confidences to each o...
Robert E. Schapire, Yoram Singer
IJON
2007
119views more  IJON 2007»
14 years 11 months ago
Finite sample effects of the fast ICA algorithm
Many algorithms for independent component analysis (ICA) and blind source separation (BSS) can be considered particular instances of a criterion based on the sum of two terms: C(Y...
Sergio Bermejo
ICNS
2006
IEEE
15 years 6 months ago
Anycast Algorithms Supporting Optical Burst Switched Grid Networks
— In this paper we consider implementing optical burst switching as a technology for building Grids with computationally intensive requirements. This architecture has been referr...
Marc De Leenheer, Farid Farahmand, Kejie Lu, Tao Z...
ANTS
2008
Springer
110views Algorithms» more  ANTS 2008»
15 years 1 months ago
Computing Hilbert Class Polynomials
We present and analyze two algorithms for computing the Hilbert class polynomial HD. The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < ...
Juliana Belding, Reinier Bröker, Andreas Enge...