473,905 Hits in 5.2 sec

Multi-Level Spherical Locality Sensitive Hashing For Approximate Near Neighbors [article]

Teresa Nicole Brooks, Rania Almajalid
2017 arXiv   pre-print
This paper introduces "Multi-Level Spherical LSH": parameter-free, a multi-level, data-dependant Locality Sensitive Hashing data structure for solving the Approximate Near Neighbors Problem (ANN).  ...  This data structure uses a modified version of a multi-probe adaptive querying algorithm, with the potential of achieving a O(n^p + t) query run time, for all inputs n where t <= n.  ...  Parameter-free Locality Sensitive Hashing for Spherical Range Reporting In this paper, the authors propose two adaptive LSH based algorithms to solve the spherical range reporting problem, as well as a  ... 
arXiv:1709.03517v2 fatcat:5yuof3wnqzaizj64q3srk7f35y

The k-means range algorithm for personalized data clustering in e-commerce

Georgios P. Papamichail, Dimitrios P. Papamichail
2007 European Journal of Operational Research  
This paper describes the k-means range algorithm, a combination of the partitional k-means clustering algorithm with a well known spatial data structure, namely the range tree, which allows fast range  ...  It offers a real-time solution for the development of distributed interactive decision aids in e-commerce since it allows the consumer to model his preferences along multiple dimensions, search for product  ...  reported from the multi-dimensional range search).  ... 
doi:10.1016/j.ejor.2005.04.011 fatcat:er4lgbmozrhnrnai5qeiannimy

GPU Accelerated Range Trees with Applications [chapter]

Manoj Kumar Maramreddy, Kishore Kothapalli
2014 Lecture Notes in Computer Science  
On an input of 1 M points in a 2-dimensional space, our implementation on a single Nvidia GTX 580 GPU for constructing a range tree shows an improvement of 12X over a 12-threaded CPU implementation.  ...  Defined simply, the problem is to preprocess a given a set of points in a d-dimensional space so that the points that lie inside an orthogonal query rectangle can be efficiently reported.  ...  As a case-study, we consider data structures for multi-dimensional datasets such as the range tree.  ... 
doi:10.1007/978-3-319-09873-9_62 fatcat:caxb5u24kbfkxmcxzpq6oyp3me

Searching for Frequent Colors in Rectangles [article]

Marek Karpinski, Yakov Nekrich
2008 arXiv   pre-print
We describe several data structures for that problem that use pseudo-linear space and answer queries in poly-logarithmic time.  ...  We study a new variant of colored orthogonal range searching problem: given a query rectangle Q all colors c, such that at least a fraction τ of all points in Q are of color c, must be reported.  ...  Acknowledgment We would like to thank Mark de Berg and Herman Haverkort for stimulating discussions and for suggestions concerning the new variant of colored range searching problem.  ... 
arXiv:0805.1348v1 fatcat:p4fpulfg4zfarnhc4es53zzfju

Fast High-Dimensional Data Search in Incomplete Databases

Beng Chin Ooi, Cheng Hian Goh, Kian-Lee Tan
1998 Very Large Data Bases Conference  
The first is a multi-dimensional index structure, called the Bitstring-augmented R-tree (BR-tree), whereas the second comprises a family of multiple one-dimensional one-attribute (MO-SAIC) indexes.  ...  We propose and evaluate two indexing schemes for improving the efficiency of data retrieval in high-dimensional databases that are incomplete.  ...  We like to thank Haoyu Dai for his research assistantship, and Kriegel and his colleagues for allowing us to use the dataset in [3] for our experiments.  ... 
dblp:conf/vldb/OoiGT98 fatcat:sc3a62l7jzactofctxynflqvci

Distributed Searching of Multi-dimensional Data: A Performance Evaluation Study

Enrico Nardelli, Fabio Barillari, Massimo Pepe
1998 Journal of Parallel and Distributed Computing  
In this paper we present a data structure for searching in multi-dimensional point sets in distributed environments and discuss its experimental evaluation also through a comparison with previous proposals  ...  The data structure supports exact, partial, and range search queries with a complexity that is optimal in a distributed sense.  ...  ACKNOWLEDGMENTS The first author thanks Witold Litwin, Marie-Anne Neimat, and Donovan Schneider for having introduced him to the field of distributed spatial data structures and for many interesting discussions  ... 
doi:10.1006/jpdc.1998.1428 fatcat:jlh4fsrjfjfzncrjakgwyoz52y

MD-HBase: A Scalable Multi-dimensional Data Infrastructure for Location Aware Services

Shoji Nishimura, Sudipto Das, Divyakant Agrawal, Amr El Abbadi
2011 2011 IEEE 12th International Conference on Mobile Data Management  
Our approach leverages a multi-dimensional index structure layered over a Key-value store.  ...  Traditional DBMSs, equipped with multi-dimensional index structures, can efficiently handle spatio-temporal data.  ...  ACKNOWLEDGMENTS The authors would like to thank the anonymous reviewers for their helpful comments. This work is partly funded by NSF grants III 1018637 and CNS 1053594.  ... 
doi:10.1109/mdm.2011.41 dblp:conf/mdm/NishimuraDAA11 fatcat:4rrigdhhrzg27mdsbti6mzziuq

A distributed range query framework for the internet of things

Congcong Zhang, Tingting Zhang, Mei Wang
2015 2015 18th International Conference on Intelligence in Next Generation Networks  
In addition, we selected some strong peers to be used as the super peers to create a data index by collecting the reporting data range, which will be used for performing range queries.  ...  In order to save energy costs and reduce the network traffic, we suggest a reporting data range mechanism in the sensing peers, which choose to report a data range and report again only when the peer senses  ...  A Distributed Range Query Framework for the Internet of Things  ... 
doi:10.1109/icin.2015.7073811 dblp:conf/icin/ZhangZW15 fatcat:3w7zm65l7bfp7a3xbwot5rchya

A multi-modal pattern classification framework for hyperspectral image analysis

Wei Li, Saurabh Prasad, James E. Fowler, Lori M. Bruce
2011 2011 3rd Workshop on Hyperspectral Image and Signal Processing: Evolution in Remote Sensing (WHISPERS)  
This is followed by a Gaussian Mixture Model (GMM) classifier for effective classification of the reduced dimensional multi-modal data.  ...  The framework employs Local Fisher's Discriminant Analysis (LFDA) to reduce the dimensionality of the data while preserving its multi-modal structure.  ...  Employing conventional linear dimensionality reduction techniques such as LDA as a preprocessing often destroys the underlying multi-modal structure of the data, rendering GMMs ineffective.  ... 
doi:10.1109/whispers.2011.6080894 dblp:conf/whispers/LiPFB11 fatcat:5sgmohkrkrbmvax576l7dwur4e

Multi-dimensional Range Query on Outsourced Database with Strong Privacy Guarantee

Do Hoang Giang, Ng Wee Keong
2017 International Journal of Computer Network and Information Security  
This paper investigates a solution to one of the most important types of query operations over encrypted data, namely multidimensional range queries.  ...  Cloud services have provided important solutions for drastically reducing the cost of data management and maintenance.  ...  Secure Range Query There are essentially three general approaches for tackling multi-dimensional range queries on encrypted data: special data structure for range query evaluation, bucketization-based  ... 
doi:10.5815/ijcnis.2017.10.02 fatcat:ni37ysodvrcpxofeawexjug2va

Efficient evaluation of partially-dimensional range queries in large OLAP datasets

Yaokai Feng, Kunihiko Kaneko, Akifumi Makinouchi
2011 International Journal of Data Mining Modelling and Management  
Such range queries are called PD (Partially-Dimensional) range queries in this study. Based on R*-tree, we propose a new index structure, called AR*-tree, to counter the actual queries on OLAP data.  ...  In light of the increasing requirement for processing multidimensional queries on OLAP (relational) data, the database community has focused on the queries (especially range queries) on the large OLAP  ...  A multi-dimensional clustering method is also proposed (Bhattacharjee, 2003) . However, it is also on the physical organization of the original relational data.  ... 
doi:10.1504/ijdmmm.2011.041493 fatcat:4trs2rpqxraadobgiojynjc5bu

A Fault Tolerant Data Structure for Peer-to-Peer Range Query Processing

Zahra Mirikharaji, Bradford G. Nickerson
2015 Canadian Conference on Computational Geometry  
We present a fault tolerant dynamic data structure based on a constant-degree Distributed Hash Table (DHT) called FissionE that supports orthogonal range search in d-dimensional space.  ...  A publication algorithm, which distributes data objects among all nodes in the network is described, along with a search algorithm that processes range queries and reports all objects in range to the query  ...  The worst case cost for a d-dimensional range search on our data structure with n nodes is O(log n + m) messages, for m the minimum number of nodes intersecting the query.  ... 
dblp:conf/cccg/MirikharajiN15 fatcat:hch263bjizgqbio5f66dwoeuzi

An Improved ISOMAP for Visualization and Classification of Multiple Manifolds [chapter]

Wang Hong-Yuan, Ding Xiu-Jie, Cheng Qi-Cai, Chen Fu-Hua
2013 Lecture Notes in Computer Science  
The classical algorithm ISOMAP can find the intrinsic low-dimensional structures hidden in high-dimensional data uniformly distributed on or around a single manifold.  ...  In this paper, two improved versions of ISOMAP, namely Multi-Class Multi-Manifold ISOMAP (MCMM-ISOMAP) for data visualization and ISOMAP for Classification (ISOMAP-C), are proposed respectively.  ...  The limitations of linear dimensionality reduction are based on the assumption that the data structure is globally linear, but in practice, a lot of data are more complex and have nonlinear structure.  ... 
doi:10.1007/978-3-642-42042-9_1 fatcat:tlwum3sj6ngqdiho2rofotoawu

Mitigating Spreadsheet Risk in Complex Multi-Dimensional Models in Excel [article]

Steve Litt
2018 arXiv   pre-print
The following solution is designed to mitigate spreadsheet risk for a set of problems commonly addressed in a spreadsheet defined as "complex multi-dimensional models".  ...  " referring to providing capabilities such as reporting, data input forms and ad hoc analysis on the different attributes associated with the resulting model.  ...  One common problem is "complex multi-dimensional" models. The following is an example of a complex multi-dimensional model showcasing a P&L for a fictitious global Lighting Company.  ... 
arXiv:1802.01640v1 fatcat:oh657amosrh5tgben7mqojhaam

Indexing shapes in image databases using the centroid–radii model

Kian-Lee Tan, Beng Chin Ooi, Lay Foo Thiang
2000 Data & Knowledge Engineering  
This facilitates multi-resolution and similarity retrievals. Furthermore, using the model, the shape of an object can be transformed into a point in a high-dimensional data space.  ...  ., study the speed of retrieval, since a slow system is not useful for large image databases.  ...  Except for the root entity, each entity is completely contained in the entity corresponding to its parent node. The NR-trees is a multi-layer tree structure designed to index high-dimensional data.  ... 
doi:10.1016/s0169-023x(99)00039-7 fatcat:hqsghqvg6jgmjiafzw6ougefxa
« Previous Showing results 1 — 15 out of 473,905 results