منابع مشابه
Kernel-Based Transductive Learning with Nearest Neighbors
In the k-nearest neighbor (KNN) classifier, nearest neighbors involve only labeled data. That makes it inappropriate for the data set that includes very few labeled data. In this paper, we aim to solve the classification problem by applying transduction to the KNN algorithm. We consider two groups of nearest neighbors for each data point — one from labeled data, and the other from unlabeled dat...
متن کاملOpinion dynamics with similarity-based random neighbors
A typical assumption made in the existing opinion formation models is that two individuals can communicate with each other only if the distance between their opinions is less than a threshold called bound of confidence. However, in the real world it is quite possible that people may also have a few friends with quite different opinions. To model this situation, we propose a bounded confidence p...
متن کاملA Clustering Algorithm Based Absorbing Nearest Neighbors
The clustering over various granularities for high dimensional data in arbitrary shape is a challenge in data mining. In this paper Nearest Neighbors Absorbed First (NNAF) clustering algorithm is proposed to solve the problem based on the idea that the objects in the same cluster must be near. The main contribution includes:(1) A theorem of searching nearest neighbors (SNN) is proved. Based on ...
متن کاملRich Neighbors
Theories of economic development suggest variously that national income increases or decreases the propensity for states to fight, while systematic evidence of the impact of development on warfare is ambiguous or non-existent. The lack of empirical support for nominally opposing claims can be reconciled if elements of both sets of arguments are partially correct. We use a formal model to constr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2018
ISSN: 2156-5570,2158-107X
DOI: 10.14569/ijacsa.2018.091228