Sciweavers

1918 search results - page 343 / 384
» Discovering Cortical Algorithms
Sort
View
ICDM
2002
IEEE
145views Data Mining» more  ICDM 2002»
14 years 20 days ago
Mining Top-K Frequent Closed Patterns without Minimum Support
In this paper, we propose a new mining task: mining top-k frequent closed patterns of length no less than min , where k is the desired number of frequent closed patterns to be min...
Jiawei Han, Jianyong Wang, Ying Lu, Petre Tzvetkov
IPPS
2000
IEEE
14 years 3 days ago
PaDDMAS: Parallel and Distributed Data Mining Application Suite
Discovering complex associations, anomalies and patterns in distributed data sets is gaining popularity in a range of scientific, medical and business applications. Various algor...
Omer F. Rana, David W. Walker, Maozhen Li, Steven ...
GI
1998
Springer
13 years 12 months ago
Self-Organizing Data Mining
"KnowledgeMiner" was designed to support the knowledge extraction process on a highly automated level. Implemented are 3 different GMDH-type self-organizing modeling algo...
Frank Lemke, Johann-Adolf Müller
AIME
1997
Springer
13 years 12 months ago
Detecting Very Early Stages of Dementia from Normal Aging with Machine Learning Methods
We used Machine Learning (ML) methods to learn the best decision rules to distinguish normal brain aging from the earliest stages of dementia using subsamples of 198 normal and 244...
William Rodman Shankle, Subramani Mani, Michael J....
ASPDAC
2007
ACM
98views Hardware» more  ASPDAC 2007»
13 years 11 months ago
Node Mergers in the Presence of Don't Cares
Abstract-- SAT sweeping is the process of merging two or more functionally equivalent nodes in a circuit by selecting one of them to represent all the other equivalent nodes. This ...
Stephen Plaza, Kai-Hui Chang, Igor L. Markov, Vale...