Sciweavers

1918 search results - page 16 / 384
» Discovering Cortical Algorithms
Sort
View
AUSAI
2004
Springer
15 years 3 months ago
Ant Colonies Discover Knight's Tours
In this paper we introduce an Ant Colony Optimisation (ACO) algorithm to find solutions for the well-known Knight’s Tour problem. The algorithm utilizes the implicit parallelism ...
Philip Hingston, Graham Kendall
TITB
2010
148views Education» more  TITB 2010»
14 years 4 months ago
Coclustering for cross-subject fiber tract analysis through diffusion tensor imaging
Abstract--One of the fundamental goals of computational neuroscience is the study of anatomical features that reflect the functional organization of the brain. The study of physica...
Cui Lin, Darshan Pai, Shiyong Lu, Otto Muzik, Jing...
JMLR
2010
102views more  JMLR 2010»
14 years 4 months ago
Discover Local Causal Network around a Target to a Given Depth
For a given target node T and a given depth k 1, we propose an algorithm for discovering a local causal network around the target T to depth k. In our algorithm, we find parents,...
You Zhou, Changzhang Wang, Jianxin Yin, Zhi Geng
CINQ
2004
Springer
133views Database» more  CINQ 2004»
15 years 1 months ago
Inductive Querying for Discovering Subgroups and Clusters
We introduce the problem of cluster-grouping and show that it integrates several important data mining tasks, i.e. subgroup discovery, mining correlated patterns and aspects from c...
Albrecht Zimmermann, Luc De Raedt
DIS
2006
Springer
15 years 1 months ago
A Novel Framework for Discovering Robust Cluster Results
We propose a novel method, called heterogeneous clustering ensemble (HCE), to generate robust clustering results that combine multiple partitions (clusters) derived from various cl...
Hye-Sung Yoon, Sang-Ho Lee, Sung-Bum Cho, Ju Han K...