Sciweavers

1175 search results - page 45 / 235
» A scalable method for the generation of small test sets
Sort
View
KDD
2002
ACM
150views Data Mining» more  KDD 2002»
14 years 8 months ago
Querying multiple sets of discovered rules
Rule mining is an important data mining task that has been applied to numerous real-world applications. Often a rule mining system generates a large number of rules and only a sma...
Alexander Tuzhilin, Bing Liu
DMKD
1997
ACM
308views Data Mining» more  DMKD 1997»
14 years 23 hour ago
A Fast Clustering Algorithm to Cluster Very Large Categorical Data Sets in Data Mining
Partitioning a large set of objects into homogeneous clusters is a fundamental operation in data mining. The k-means algorithm is best suited for implementing this operation becau...
Zhexue Huang
ICCAD
1994
IEEE
112views Hardware» more  ICCAD 1994»
13 years 12 months ago
Selecting partial scan flip-flops for circuit partitioning
This paper presents a new method of selecting scan ipops (FFs) in partial scan designs of sequential circuits. Scan FFs are chosen so that the whole circuit can be partitioned in...
Toshinobu Ono
VG
2001
13 years 9 months ago
A Study of Transfer Function Generation for Time-Varying Volume Data
The proper usage and creation of transfer functions for time-varying data sets is an often ignored problem in volume visualization. Although methods and guidelines exist for time-i...
T. J. Jankun-Kelly, Kwan-Liu Ma
ICANNGA
2009
Springer
163views Algorithms» more  ICANNGA 2009»
13 years 11 months ago
Elitistic Evolution: An Efficient Heuristic for Global Optimization
A new evolutionary algorithm, Elitistic Evolution (termed EEv), is proposed in this paper. EEv is an evolutionary method for numerical optimization with adaptive behavior. EEv uses...
Francisco Viveros Jiménez, Efrén Mez...