Sciweavers

4560 search results - page 39 / 912
» Finding Data in the Neighborhood
Sort
View
EOR
2008
84views more  EOR 2008»
13 years 7 months ago
Complexity of local search for the p-median problem
For the p-median problem we study complexity of finding a local minimum in the worst and the average cases. We introduce several neighborhoods and show that the corresponding loca...
Ekaterina Alekseeva, Yury Kochetov, Alexander Plya...
SADM
2010
196views more  SADM 2010»
13 years 2 months ago
Bayesian adaptive nearest neighbor
: The k nearest neighbor classification (k-NN) is a very simple and popular method for classification. However, it suffers from a major drawback, it assumes constant local class po...
Ruixin Guo, Sounak Chakraborty
KDD
2002
ACM
138views Data Mining» more  KDD 2002»
14 years 8 months ago
Finding surprising patterns in a time series database in linear time and space
Eamonn J. Keogh, Stefano Lonardi, Bill Yuan-chi Ch...
ICDM
2006
IEEE
134views Data Mining» more  ICDM 2006»
14 years 1 months ago
Biclustering Protein Complex Interactions with a Biclique Finding Algorithm
Chris H. Q. Ding, Ya Zhang, Tao Li, Stephen R. Hol...
AI
2005
Springer
14 years 1 months ago
Instance Cloning Local Naive Bayes
The instance-based k-nearest neighbor algorithm (KNN)[1] is an effective classification model. Its classification is simply based on a vote within the neighborhood, consisting o...
Liangxiao Jiang, Harry Zhang, Jiang Su