Results 81 to 90 of about 104,528 (306)
Latching chains in K-nearest-neighbor and modular small-world networks [PDF]
, 2015 Latching dynamics retrieve pattern sequences successively by neural adaption and pattern correlation. We have previously proposed a modular latching chain model in Song et al.
Simonov, Alexander Yurievich +2 more
core
The condensed nearest neighbor rule using the concept of mutual nearest neighborhood (Corresp.) [PDF]
, 1979 A two-stage iterative algorithm for selecting a subset of a training set of samples for use in a condensed nearest neighbor (CNN) decision rule is introduced. The proposed method uses the concept of mutual nearest neighborhood for selecting samples close
Krishna, G, Gowda, K
core
Information Retrieval Document Classified with K-Nearest Neighbor
Record and Library Journal, 2016 Along with the rapid advancement of technology development led to the amount of information available is also increasingly abundant. The aim of this study was to determine how the implementation of information retrieval system in the classification of ...
Badruz Zaman +2 more
doaj +1 more source
Improving Prediction Performance of Dynamic Neighbor Selection in User-Based Collaborative Filtering
Sakarya University Journal of Computer and Information Sciences, 2020 Recommender systems have become more and more popular in online environments in recent years. Although different approaches are introduced to build a powerful recommender system, collaborative filtering is one of the most used approaches in the ...
Burcu Demirelli Okkalıoğlu
doaj +1 more source
Evolutionarily divergent DUF4465 domains have a common vitamin B12‐binding function
FEBS Open Bio, EarlyView.We show that DUF4465 family proteins, widespread across bacteria from gut microbiomes, hydrothermal vents, and soil, share a common vitamin B12‐binding function. These augmented β‐jellyroll proteins bind vitamin B12 via extended loops. Our findings establish sequence‐diverse DUF4465 proteins as a widespread class of B12‐binding proteins, highlighting ...
Charlea Clarke +4 more
wiley +1 more source
Systems and Soft ComputingWith the development of the digital age, library services are facing the challenge of fast and accurate text classification. The traditional K-nearest neighbor algorithm is limited by low classification efficiency and high computational complexity when ...
Changjun Wang, Fengxia You, Yu Wang
doaj +1 more source
Kinetic Reverse k-Nearest Neighbor Problem [PDF]
, 2015 This paper provides the first solution to the kinetic reverse $k$-nearest neighbor (\rknn) problem in $\mathbb{R}^d$, which is defined as follows: Given a set $P$ of $n$ moving points in arbitrary but fixed dimension $d$, an integer $k$, and a query point $q\notin P$ at any time $t$, report all the points $p\in P$ for which $q$ is one of the $k ...
Zahed Rahmati +2 more
openaire +2 more sources
Directed evolution of enzymes at the crossroads of tradition and innovation
FEBS Open Bio, EarlyView.An iterative cycle of data‐driven enzyme optimization comprising four stages: genetic diversification of a template enzyme, expression of protein variants, high‐throughput evaluation, and machine‐learning‐guided redesign of the next variant library.
Maria Tomkova +2 more
wiley +1 more source
Dictionary-based lip reading classification [PDF]
, 2006 Visual lip reading recognition is an essential stage in many multimedia systems such as “Audio Visual Speech Recognition” [6], “Mobile Phone Visual System for deaf people”, “Sign Language Recognition System”, etc. The use of lip visual features to help
Dahai Yu +7 more
core
Approximate k-flat Nearest Neighbor Search [PDF]
, 2015 Let k be a nonnegative integer. In the approximate k-flat nearest neighbor (k-ANN) problem, we are given a set P ⊂ Rd of n points in d-dimensional space and a fixed approximation factor c> 1.
Paul Seiferth +3 more
core +1 more source