Sciweavers

1038 search results - page 48 / 208
» A Genetic Algorithm for Clustering on Very Large Data Sets
Sort
View
EDBT
2012
ACM
228views Database» more  EDBT 2012»
11 years 11 months ago
Finding maximal k-edge-connected subgraphs from a large graph
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
Rui Zhou, Chengfei Liu, Jeffrey Xu Yu, Weifa Liang...
KDD
2001
ACM
196views Data Mining» more  KDD 2001»
14 years 9 months ago
Efficient discovery of error-tolerant frequent itemsets in high dimensions
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
Cheng Yang, Usama M. Fayyad, Paul S. Bradley
SSPR
2004
Springer
14 years 2 months ago
Optimizing Classification Ensembles via a Genetic Algorithm for a Web-Based Educational System
Classification fusion combines multiple classifications of data into a single classification solution of greater accuracy. Feature extraction aims to reduce the computational cost ...
Behrouz Minaei-Bidgoli, Gerd Kortemeyer, William F...
JCM
2007
129views more  JCM 2007»
13 years 8 months ago
Evolutionary Approach for Efficient Resource Allocation in Multi-User OFDM Systems
– Orthogonal Frequency Division Multiplexing is a promising technology for high data rate transmission in wideband wireless systems for achieving high downlink capabilities in th...
Yenumula B. Reddy, Nandigam Gajendar
ALGOSENSORS
2006
Springer
14 years 12 days ago
Self-stabilizing Weight-Based Clustering Algorithm for Ad Hoc Sensor Networks
Ad hoc sensor networks consist of large number of wireless sensors that communicate with each other in the absence of a xed infrastructure. Fast self-recon guration and power eci...
Colette Johnen, Le Huy Nguyen