Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/70833
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Computing | en_US |
dc.creator | Chan, TN | en_US |
dc.creator | Yiu, ML | en_US |
dc.creator | Hua, KA | en_US |
dc.date.accessioned | 2017-12-28T06:18:15Z | - |
dc.date.available | 2017-12-28T06:18:15Z | - |
dc.identifier.issn | 1041-4347 | en_US |
dc.identifier.uri | http://hdl.handle.net/10397/70833 | - |
dc.language.iso | en | en_US |
dc.publisher | Institute of Electrical and Electronics Engineers | en_US |
dc.rights | © 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. | en_US |
dc.rights | The following publication T. N. Chan, M. L. Yiu and K. A. Hua, "Efficient Sub-Window Nearest Neighbor Search on Matrix," in IEEE Transactions on Knowledge and Data Engineering, vol. 29, no. 4, pp. 784-797, 1 April 2017 is available at https://doi.org/10.1109/TKDE.2016.2633357 | en_US |
dc.subject | Nearest neighbor | en_US |
dc.subject | Similarity search | en_US |
dc.title | Efficient sub-window nearest neighbor search on matrix | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.spage | 784 | en_US |
dc.identifier.epage | 797 | en_US |
dc.identifier.volume | 29 | en_US |
dc.identifier.issue | 4 | en_US |
dc.identifier.doi | 10.1109/TKDE.2016.2633357 | en_US |
dcterms.abstract | We study a nearest neighbor search problem on a matrix by its element values. Given a data matrix D and a query matrix q, the sub-window nearest neighbor search problem finds a sub-window of D that is the most similar to q. This problem has a wide range of applications, e.g., geospatial data integration, object detection, and motion estimation. In this paper, we propose an efficient progressive search solution that overcomes the drawbacks of existing solutions. First, we present a generic approach to build level-based lower bound functions on top of basic lower bound functions. Second, we develop a novel lower bound function for a group of sub-windows, in order to boost the efficiency of our solution. Furthermore, we extend our solution to support irregular-shaped queries. Experimental results on real data demonstrate the efficiency of our proposed methods. | en_US |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | IEEE transactions on knowledge and data engineering, Apr. 2017, v. 29, no. 4, p. 784-797 | en_US |
dcterms.isPartOf | IEEE transactions on knowledge and data engineering | en_US |
dcterms.issued | 2017-04 | - |
dc.identifier.isi | WOS:000397581000006 | - |
dc.identifier.ros | 2016001223 | - |
dc.identifier.eissn | 1558-2191 | en_US |
dc.identifier.rosgroupid | 2016001205 | - |
dc.description.ros | 2016-2017 > Academic research: refereed > Publication in refereed journal | en_US |
dc.description.validate | bcrc | en_US |
dc.description.oa | Accepted Manuscript | en_US |
dc.identifier.SubFormID | COMP-1280 | - |
dc.description.fundingSource | RGC | en_US |
dc.description.pubStatus | Published | en_US |
dc.identifier.OPUS | 6732749 | - |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Yiu_Efficient_Sub-Window_Nearest.pdf | Pre-Published version | 2.03 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.