Sciweavers

9359 search results - page 148 / 1872
» Generalization Algorithms for Second-Order Terms
Sort
View
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
16 years 4 months ago
A fast algorithm for finding frequent episodes in event streams
Frequent episode discovery is a popular framework for mining data available as a long sequence of events. An episode is essentially a short ordered sequence of event types and the...
Srivatsan Laxman, P. S. Sastry, K. P. Unnikrishnan
JCDL
2006
ACM
71views Education» more  JCDL 2006»
15 years 10 months ago
Using controlled query generation to evaluate blind relevance feedback algorithms
Currently in document retrieval there are many algorithms each with different strengths and weakness. There is some difficulty, however, in evaluating the impact of the test quer...
Chris Jordan, Carolyn R. Watters, Qigang Gao
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
15 years 10 months ago
On the runtime analysis of the 1-ANT ACO algorithm
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carst...
BMCBI
2006
119views more  BMCBI 2006»
15 years 4 months ago
LS-NMF: A modified non-negative matrix factorization algorithm utilizing uncertainty estimates
Background: Non-negative matrix factorisation (NMF), a machine learning algorithm, has been applied to the analysis of microarray data. A key feature of NMF is the ability to iden...
Guoli Wang, Andrew V. Kossenkov, Michael F. Ochs
WWW
2008
ACM
16 years 5 months ago
Investigation of partial query proximity in web search
Proximity of query terms in a document is an important criterion in IR. However, no investigation has been made to determine the most useful term sequences for which proximity sho...
Jing Bai, Yi Chang, Hang Cui, Zhaohui Zheng, Gordo...