Sciweavers

989 search results - page 31 / 198
» Approximating the Pareto optimal set using a reduced set of ...
Sort
View
TNN
2008
181views more  TNN 2008»
13 years 7 months ago
Optimized Approximation Algorithm in Neural Networks Without Overfitting
In this paper, an optimized approximation algorithm (OAA) is proposed to address the overfitting problem in function approximation using neural networks (NNs). The optimized approx...
Yinyin Liu, Janusz A. Starzyk, Zhen Zhu
SIGMOD
2010
ACM
262views Database» more  SIGMOD 2010»
14 years 19 days ago
K-nearest neighbor search for fuzzy objects
The K-Nearest Neighbor search (kNN) problem has been investigated extensively in the past due to its broad range of applications. In this paper we study this problem in the contex...
Kai Zheng, Gabriel Pui Cheong Fung, Xiaofang Zhou
BTW
2005
Springer
80views Database» more  BTW 2005»
14 years 1 months ago
Measuring the Quality of Approximated Clusterings
Abstract. Clustering has become an increasingly important task in modern application domains. In many areas, e.g. when clustering complex objects, in distributed clustering, or whe...
Hans-Peter Kriegel, Martin Pfeifle
ICDE
1998
IEEE
108views Database» more  ICDE 1998»
14 years 9 months ago
Efficient Discovery of Functional and Approximate Dependencies Using Partitions
Discovery of functionaldependencies from relations has been identified as an important database analysis technique. In this paper, we present a new approach for finding functional...
Ykä Huhtala, Juha Kärkkäinen, Pasi ...
IWCMC
2010
ACM
13 years 9 months ago
Using connection expansion to reduce control traffic in MANETs
We consider the problem of control traffic overhead in MANETs with long-lived connections, operating under a reactive routing protocol (e.g. AODV). In such settings, control traff...
Zeki Bilgin, Bilal Khan, Ala I. Al-Fuqaha