Sciweavers

2814 search results - page 343 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
JPDC
2007
191views more  JPDC 2007»
13 years 10 months ago
Clustering wireless ad hoc networks with weakly connected dominating set
The increasing popular personal communications and mobile computing require a wireless network infrastructure that supports selfconfiguration and self-management. Efficient clus...
Bo Han, Weijia Jia
GECCO
2005
Springer
129views Optimization» more  GECCO 2005»
14 years 4 months ago
Real-coded crossover as a role of kernel density estimation
This paper presents a kernel density estimation method by means of real-coded crossovers. Estimation of density algorithms (EDAs) are evolutionary optimization techniques, which d...
Jun Sakuma, Shigenobu Kobayashi
MCS
2009
Springer
14 years 3 months ago
Incremental Learning of Variable Rate Concept Drift
We have recently introduced an incremental learning algorithm, Learn++ .NSE, for Non-Stationary Environments, where the data distribution changes over time due to concept drift. Le...
Ryan Elwell, Robi Polikar
ICCV
2005
IEEE
15 years 20 days ago
Neighborhood Preserving Embedding
Recently there has been a lot of interest in geometrically motivated approaches to data analysis in high dimensional spaces. We consider the case where data is drawn from sampling...
Xiaofei He, Deng Cai, Shuicheng Yan, HongJiang Zha...
KDD
2004
ACM
158views Data Mining» more  KDD 2004»
14 years 11 months ago
A generalized maximum entropy approach to bregman co-clustering and matrix approximation
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
Arindam Banerjee, Inderjit S. Dhillon, Joydeep Gho...