Results 61 to 70 of about 4,853 (185)
A Hubness Information-Based k-Nearest Neighbor Approach for Multi-Label Learning
MathematicsMulti-label classification (MLC) plays a crucial role in various real-world scenarios. Prediction with nearest neighbors has achieved competitive performance in MLC. Hubness, a phenomenon in which a few points appear in the k-nearest neighbor (kNN) lists
Zeyu Teng +3 more
doaj +1 more source
Distributed KNN Query Processing for Sequences with Similar Patterns
, 2014 序列資料在我們的日常生活中隨處可見，像是物件移動軌跡、生物基因序列、金融或購買商品交易記錄等等，涵蓋的範圍極廣，具有極高的研究價值。序列型樣分析 (Sequence Pattern Analysis) 是資料探勘最重要的研究領域之一，主要是要找出隱藏在序列資料中的特徵 (型樣)，例如 DNA 或蛋白質序列的 Motif、物件移動軌跡的規律性或瀏覽網頁的習慣性等等。序列資料的特徵比原始序列更容易理解且更具代表性，經常用於資料的檢索和查詢。近來，隨著生物晶片、感測和無線網路等相關技術的進步 ...
萬年松, Wan, Nian-Song
core
KNN Query Processing in Wireless Sensor and Robot Networks
, 2014 In Wireless Sensor and Robot Networks (WSRNs), static sensors report event information to one of the robots. In the k nearest neighbour query processing problem in WSRNs, the robot receives event report needs to find exact k nearest robots (KNN) to react
Xie, Wei
core
SMPKR: Search Engine for Internet of Things
IEEE Access, 2019 The Internet of Things (IoT) has become the infrastructure to widely support ubiquitous applications. Due to the highly dynamic context setting, IoT search engines have attracted increasing attention from both industrial and academic field to crawl and ...
Jine Tang +3 more
doaj +1 more source
Finding the K nearest objects over time dependent road networks
, 2018 K nearest neighbor (kNN) search is an important problem and has been well studied on static road networks. However, in real world, road networks are often time-dependent, i.e., the time for traveling through a road always changes over time. Most existing
Xin Wang +9 more
core +1 more source
Secure kNN Query Processing using VD-kNN In an Untrusted Cloud Enviroments
, 2017 At the moment, data is stored with a third party in cloud environments and query processing is also done by third party to reduce the amount to maintain the system.
Kahate, Prof. Sandip A +1 more
core +1 more source
LK-Index: A Learned Index for KNN Queries
IEEE AccessThe k-Nearest Neighbor (kNN) search is a crucial problem in database and data mining, especially in high-dimensional space. However, traditional kNN algorithms based on distance metrics and brute-force search often have low search efficiency and accuracy, and high computational complexity when dealing with large-scale high-dimensional datasets.
openaire +2 more sources
, 2017 Telecom companies do a lot of analytics to provide consumers a better service and to stay in competition. These companies accumulate special big data that has potential to provide inputs for business.
Kalakuntla, Preetham
core
Reverse kNN Query Algorithm on Road Network Distance [PDF]
, 2015 This paper proposed a reverse k nearestneighbor (RkNN) query algorithm in road networkdistance by using the simple materialization path view(SMPV) data structure.When a set of interest objects Pand a query point q are given, RkNN query retrievesreverse ...
Htoo, Htoo +2 more
core
Exploring bit-difference for approximate knn search
, 2005 — In this paper, we develop a novel index structure to support efficient approximate k-nearest neighbor (KNN) query in high-dimensional databases. In high-dimensional spaces, the computational cost of the distance (e.g., Euclidean distance) between two ...
Jialie Shen +3 more
core