Sciweavers

1918 search results - page 115 / 384
» Discovering Cortical Algorithms
Sort
View
DSN
2007
IEEE
15 years 1 months ago
Automatic Verification and Discovery of Byzantine Consensus Protocols
Model-checking of asynchronous distributed protocols is challenging because of the large size of the state and solution spaces. This paper tackles this problem in the context of l...
Piotr Zielinski
EDBT
2000
ACM
15 years 1 months ago
Mining Classification Rules from Datasets with Large Number of Many-Valued Attributes
Decision tree induction algorithms scale well to large datasets for their univariate and divide-and-conquer approach. However, they may fail in discovering effective knowledge when...
Giovanni Giuffrida, Wesley W. Chu, Dominique M. Ha...
BMCBI
2004
181views more  BMCBI 2004»
14 years 9 months ago
Iterative class discovery and feature selection using Minimal Spanning Trees
Background: Clustering is one of the most commonly used methods for discovering hidden structure in microarray gene expression data. Most current methods for clustering samples ar...
Sudhir Varma, Richard Simon
ICDE
1998
IEEE
270views Database» more  ICDE 1998»
15 years 11 months ago
Cyclic Association Rules
We study the problem of discovering association rules that display regular cyclic variation over time. For example, if we compute association rules over monthly sales data, we may...
Banu Özden, Sridhar Ramaswamy, Abraham Silber...
BMCBI
2008
178views more  BMCBI 2008»
14 years 10 months ago
Identification of coherent patterns in gene expression data using an efficient biclustering algorithm and parallel coordinate vi
Background: The DNA microarray technology allows the measurement of expression levels of thousands of genes under tens/hundreds of different conditions. In microarray data, genes ...
Kin-On Cheng, Ngai-Fong Law, Wan-Chi Siu, Alan Wee...