Sciweavers

1918 search results - page 95 / 384
» Discovering Cortical Algorithms
Sort
View
IEAAIE
2009
Springer
15 years 4 months ago
An Efficient Algorithm for Maintaining Frequent Closed Itemsets over Data Stream
Data mining refers to the process of revealing unknown and potentially useful information from a large database. Frequent itemsets mining is one of the foundational problems in dat...
Show-Jane Yen, Yue-Shi Lee, Cheng-Wei Wu, Chin-Lin...
WEBI
2007
Springer
15 years 4 months ago
K-SVMeans: A Hybrid Clustering Algorithm for Multi-Type Interrelated Datasets
Identification of distinct clusters of documents in text collections has traditionally been addressed by making the assumption that the data instances can only be represented by ...
Levent Bolelli, Seyda Ertekin, Ding Zhou, C. Lee G...
DAWAK
2004
Springer
15 years 3 months ago
Algorithms for Discovery of Frequent Superset, Rather than Frequent Subset
Abstract. In this paper, we propose a novel mining task: mining frequent superset from the database of itemsets that is useful in bioinformatics, e-learning systems, jobshop schedu...
Zhung-Xun Liao, Man-Kwan Shan
COCOON
2001
Springer
15 years 2 months ago
A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...
Valerie King, Mikkel Thorup
EVOW
2009
Springer
15 years 1 months ago
A Hierarchical Classification Ant Colony Algorithm for Predicting Gene Ontology Terms
Abstract. This paper proposes a novel Ant Colony Optimisation algorithm for the hierarchical problem of predicting protein functions using the Gene Ontology (GO). The GO structure ...
Fernando E. B. Otero, Alex Alves Freitas, Colin G....