Results 31 to 40 of about 84,282 (259)
Jambura Journal of Mathematics, 2023 This paper discusses the performance of the K-Nearest Neighbor Algorithm with dimension reduction using Principal Component Analysis (PCA) in the case of diabetes disease classification.
Aldila Dinanti, Joko Purwadi
doaj +1 more source
Navigating K-Nearest Neighbor Graphs to Solve Nearest Neighbor Searches [PDF]
, 2010 Nearest neighbor queries can be satisfied, in principle, with a greedy algorithm under a proximity graph. Each object in the database is represented by a node, and proximal nodes in this graph will share an edge. To find the nearest neighbor the idea is quite simple, we start in a random node and get iteratively closer to the nearest neighbor following
Edgar Chávez, Eric Sadit Tellez
openaire +1 more source
Multi-type K-nearest Neighbor Query Scheme with Mutual Privacy-preserving in Road Networks [PDF]
Jisuanji kexueIn the Internet of vehicles scenario,existing location-based service privacy-preserving schemes have issues such as not supporting parallel query of multi-type K-nearest neighbor points of interest,difficulty to protect the privacy of both the in-vehicle
ZENG Congai, LIU Yali, CHEN Shuyi, ZHU Xiuping, NING Jianting
doaj +1 more source
The human gut microbiome across the life course
FEBS Letters, EarlyView.Despite significant individual variation and continuous change throughout life, the human gut microbiome follows some life stage‐specific trends. This article provides a brief overview of how gut microbiome composition shifts across different phases of life. Created in BioRender. Özkurt, E. (2026) https://BioRender.com/8q4nrnc.
Alise J. Ponsero +4 more
wiley +1 more source
FEBS Letters, EarlyView.Septin 9 polybasic domains couple phosphoinositide‐rich membrane binding to centrosome positioning, Golgi organization, and microtubule acetylation to control epithelial polarity. Their loss disrupts this axis, causing centrosome mispositioning, Golgi fragmentation, reduced microtubule acetylation, and polarity inversion via upregulation of the ...
Ting ting Cai +4 more
wiley +1 more source
A Continuous k-Nearest Neighbor Query Method for Moving Data in Obstructed Spaces
Journal of Harbin University of Science and Technology, 2018 For the nearest neighbor query problem of continuous moving objects in spatio-temporal databases, the COpKNN (continuous obstructed possible k-nearest neighbor) query is proposed: in a two-dimensional space, given a moving query point q, a set of moving ...
WAN Jing +3 more
doaj +1 more source
Modelling stem cell differentiation related processes—A practical overview for biologists
FEBS Letters, EarlyView.Stem cell differentiation is complex and difficult to control experimentally. This review introduces suitable computational modelling approaches that can support stem cell research, from mechanistic ODE and abstract models to multiscale and deep learning methods.
Ricco Zeegelaar +4 more
wiley +1 more source
Fast Approximate Complete-data k-nearest-neighbor Estimation
Austrian Journal of Statistics, 2020 We introduce a fast method to estimate the complete-data set of k-nearest-neighbors.This is equivalent to finding an estimate of the k-nearest-neighbor graph of the data. The method relies on random normal projections.
Alejandro Murua, Nicolas Wicker
doaj +1 more source
Pilar Nusa Mandiri, 2022 Classification of blood donor data at UTD PMI Bali Province by applying the C4.5 and K-Nearest Neighbor algorithms. The number of blood donor data donors is 34,948, of which 90% of the data, namely 31,454 is used as training data.
Ni Ketut Melly Astuti +2 more
doaj +1 more source
Structure‐forward targeting of claudins with synthetic binders
FEBS Letters, EarlyView.Claudins form the paracellular barriers between epithelial and endothelial tissues at tight junctions and are targets for molecular binders with the goal of modulating barrier permeability. Claudin‐binding molecules are relevant in drug delivery or in altering claudin interactions with disease‐causing proteins.
Alex J. Vecchio
wiley +1 more source