Sciweavers

4816 search results - page 114 / 964
» Performance analysis of the AntNet algorithm
Sort
View
ICA
2007
Springer
15 years 11 months ago
A Robust Complex FastICA Algorithm Using the Huber M-Estimator Cost Function
In this paper, we propose to use the Huber M-estimator cost function as a contrast function within the complex FastICA algorithm of Bingham and Hyvarinen for the blind separation o...
Jih-Cheng Chao, Scott C. Douglas
EMNLP
2008
15 years 6 months ago
Graph-based Analysis of Semantic Drift in Espresso-like Bootstrapping Algorithms
Bootstrapping has a tendency, called semantic drift, to select instances unrelated to the seed instances as the iteration proceeds. We demonstrate the semantic drift of bootstrapp...
Mamoru Komachi, Taku Kudo, Masashi Shimbo, Yuji Ma...
ICDE
2001
IEEE
163views Database» more  ICDE 2001»
16 years 6 months ago
MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases
We present a new algorithm for mining maximal frequent itemsets from a transactional database. Our algorithm is especially efficient when the itemsets in the database are very lon...
Douglas Burdick, Manuel Calimlim, Johannes Gehrke
PRDC
2002
IEEE
15 years 9 months ago
A Consensus Algorithm for Synchronous Distributed Systems using Mobile Agent
In this paper, we present a consensus algorithm for synchronous distributed systems using cooperating mobile agents. The algorithm is designed within a framework for mobile agent ...
Jiannong Cao, Xianbing Wang, Siu Lo, Sajal K. Das
CORR
2011
Springer
157views Education» more  CORR 2011»
14 years 12 months ago
Fast and Faster: A Comparison of Two Streamed Matrix Decomposition Algorithms
With the explosion of the size of digital dataset, the limiting factor for decomposition algorithms is the number of passes over the input, as the input is often stored out-of-cor...
Radim Rehurek