Sciweavers

5092 search results - page 165 / 1019
» Clustering the Feature Space
Sort
View
GECCO
2003
Springer
171views Optimization» more  GECCO 2003»
16 years 8 days ago
Genetic Algorithm Optimized Feature Transformation - A Comparison with Different Classifiers
When using a Genetic Algorithm (GA) to optimize the feature space of pattern classification problems, the performance improvement is not only determined by the data set used, but a...
Zhijian Huang, Min Pei, Erik D. Goodman, Yong Huan...
WCNC
2008
IEEE
16 years 1 months ago
Interleave Division Multiplexing Aided Space-Time Coding for High-Throughput Uplink Cooperative Communications
— In this paper, we design and investigate a novel Interleave Division Multiplexing based Space-Time Code (IDM-STC) in the context of cooperative communications. We outline the p...
Rong Zhang, Lajos Hanzo
AIR
2006
76views more  AIR 2006»
15 years 7 months ago
Evolved term-weighting schemes in Information Retrieval: an analysis of the solution space
Evolutionary computation techniques are increasingly being applied to problems within Information Retrieval (IR). Genetic programming (GP) has previously been used with some succe...
Ronan Cummins, Colm O'Riordan
JSAC
2008
56views more  JSAC 2008»
15 years 7 months ago
An efficient hierarchical optical path network design algorithm based on a traffic demand expression in a cartesian product spac
We propose a hierarchical optical path network design algorithm. In order to efficiently accommodate wavelength paths in each waveband path, we define a source-destination Cartesia...
Isao Yagyu, Hiroshi Hasegawa, Ken-ichi Sato
ICCV
2009
IEEE
1556views Computer Vision» more  ICCV 2009»
17 years 22 hour ago
Kernel Methods for Weakly Supervised Mean Shift Clustering
Mean shift clustering is a powerful unsupervised data analysis technique which does not require prior knowledge of the number of clusters, and does not constrain the shape of th...
Oncel Tuzel, Fatih Porikli, Peter Meer