The Prediction of Earthquake Building Structure Strength: Modified K-Nearest Neighbour Employment
نویسندگان
چکیده
منابع مشابه
k-Nearest Neighbour Classifiers
Perhaps the most straightforward classifier in the arsenal or machine learning techniques is the Nearest Neighbour Classifier – classification is achieved by identifying the nearest neighbours to a query example and using those neighbours to determine the class of the query. This approach to classification is of particular importance today because issues of poor run-time performance is not such...
متن کاملExploring the limits of nearest neighbour secondary structure prediction.
This paper presents a simple and robust secondary structure prediction scheme (SIMPA96) based on an updated version of the nearest neighbour method. Using a larger database of known structures, the Blosum 62 substitution matrix and a regularization algorithm, the three state prediction accuracy is increased by 4.7 percentage points to 67.7% for a single sequence and up to 72.8% when using multi...
متن کاملConvergence of random k-nearest-neighbour imputation
Random k-nearest-neighbour (RKNN) imputation is an established algorithm for filling in missing values in data sets. Assume that data are missing in a random way, so that missingness is independent of unobserved values (MAR), and assume there is a minimum positive probability of a response vector being complete. Then RKNN, with k equal to the square root of the sample size, asymptotically produ...
متن کاملCONNECTIVITY OF RANDOM k-NEAREST-NEIGHBOUR GRAPHS
LetP be a Poisson process of intensity one in a squareSn of arean. We construct a random geometric graph Gn,k by joining each point of P to its k ≡ k(n) nearest neighbours. Recently, Xue and Kumar proved that if k ≤ 0.074 log n then the probability that Gn,k is connected tends to 0 as n → ∞ while, if k ≥ 5.1774 log n, then the probability that Gn,k is connected tends to 1 as n → ∞. They conject...
متن کاملSmall components in k-nearest neighbour graphs
Let G = Gn,k denote the graph formed by placing points in a square of area n according to a Poisson process of density 1 and joining each point to its k nearest neighbours. In [2] Balister, Bollobás, Sarkar and Walters proved that if k < 0.3043 logn then the probability that G is connected tends to 0, whereas if k > 0.5139 logn then the probability that G is connected tends to 1. We prove that,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indonesian Journal of Electrical Engineering and Informatics (IJEEI)
سال: 2020
ISSN: 2089-3272,2089-3272
DOI: 10.11591/ijeei.v8i4.2403