13,842 Hits in 10.3 sec

An Improved Algorithm for Fast K-Word Proximity Search Based on Multi-component Key Indexes [chapter]

Alexander B. Veretennikov
2020 Advances in Intelligent Systems and Computing  
In a previous work, we discussed how to decrease the search time with multi-component key indexes.  ...  A search query consists of several words. In a proximity full-text search, we want to find documents that contain these words near each other.  ...  We defined several search algorithms for multi-component key indexes. In the Main-Cell algorithm [17] , we need to select the most frequently occurring lemma in the query.  ... 
doi:10.1007/978-3-030-55187-2_37 fatcat:c7xpmdiuqvdctgsoc3gyhthy4e

The Continued Saga of DB-IR Integration [chapter]

Ricardo Baeza-Yates, Mariano Consens
2004 Proceedings 2004 VLDB Conference  
Query Processing • Document fragments are extracted using the interconnection index and other indices IR on XML: TIX Algebra • TIX (Text In XML) algebra, is based on the idea of a "scored tree".  ...  Multi-row records • Compound primary keys • Efficient spidering -Event-driven updates -use database triggers -Where clauses can be used for crawling limit Verity K2 Enterprise Search -Parametric Selection  ... 
doi:10.1016/b978-012088469-8.50118-2 dblp:conf/vldb/Baeza-YatesC04 fatcat:2lzk6qlgurgbdoj6do2qtxy2za

The Continued Saga of DB-IR Integration [chapter]

2004 Proceedings 2004 VLDB Conference  
Query Processing • Document fragments are extracted using the interconnection index and other indices IR on XML: TIX Algebra • TIX (Text In XML) algebra, is based on the idea of a "scored tree".  ...  Multi-row records • Compound primary keys • Efficient spidering -Event-driven updates -use database triggers -Where clauses can be used for crawling limit Verity K2 Enterprise Search -Parametric Selection  ... 
doi:10.1016/b978-012088469-8/50118-2 fatcat:dktiusnpj5hcfbu2fopto7psqq

Hybrid Indexing for Versioned Document Search with Cluster-based Retrieval

Xin Jin, Daniel Agun, Tao Yang, Qinghao Wu, Yifan Shen, Susen Zhao
2016 Proceedings of the 25th ACM International on Conference on Information and Knowledge Management - CIKM '16  
The hybrid scheme exploits the advantages of forward index and inverted index based on the term characteristics to minimize the time in extracting positional and other feature information during runtime  ...  The experiment results show that the proposed scheme can be up-to about 4x as fast as the previous work on solid state drives while retaining good relevance.  ...  Any opinions, findings, conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the NSF.  ... 
doi:10.1145/2983323.2983733 dblp:conf/cikm/JinAYWSZ16 fatcat:qpws7znec5a3hj2psxaj262bvu

Fast non-coplanar beam orientation optimization based on group sparsity [article]

Daniel O'Connor, Yevgen Voronenko, Dan Nguyen, Wotao Yin, Ke Sheng
2017 arXiv   pre-print
The selection of beam orientations, which is a key step in radiation treatment planning, is particularly challenging for non-coplanar radiotherapy systems due to the large number of candidate beams.  ...  In this paper, we report progress on the group sparsity approach to beam orientation optimization, wherein beam angles are selected by solving a large scale fluence map optimization problem with an additional  ...  The initial work pertaining to fluence map optimization (but not group sparsity or beam orientation optimization) was funded by RefleXion Medical.  ... 
arXiv:1710.05308v1 fatcat:um3skccjyfc2tdscgh23dsaz5i

Online multi-modal distance learning for scalable multimedia retrieval

Hao Xia, Pengcheng Wu, Steven C.H. Hoi
2013 Proceedings of the sixth ACM international conference on Web search and data mining - WSDM '13  
We conducted an extensive set of experiments on multi-modal image retrieval applications, in which encouraging results validate the efficacy of the proposed technique.  ...  The definition of distance between any two objects/items on multi-modal data is a key challenge encountered by many real-world applications, including multimedia retrieval.  ...  Acknowledgments This work was in part supported by Singapore MOE Academic tier-1 grant (RG33/11) and Microsoft Research grant.  ... 
doi:10.1145/2433396.2433453 dblp:conf/wsdm/XiaWH13 fatcat:goteksqskzcubpvv6g4j7ivlpe

Fast Sparse-Group Lasso Method for Multi-response Cox Model with Applications to UK Biobank [article]

Ruilin Li, Yosuke Tanigawa, Johanne Justesen, Jonathan Taylor, Trevor Hastie, Robert J Tibshirani, Manuel A Rivas
2020 bioRxiv   pre-print
An accelerated proximal gradient method that optimizes the regularized partial-likelihood function.  ...  We propose a Sparse-Group regularized Cox regression method to analyze large-scale, ultrahigh-dimensional, and multi-response survival data efficiently. Our method has three key components: 1.  ...  Set line search parameter η > 1; Denote the parameter matrix B ∈ R d×K .  ... 
doi:10.1101/2020.06.21.163675 fatcat:e6q336346jbbvigsrog7rl3gxi

SANE: Semantic-Aware Namespacein Ultra-Large-Scale File Systems

Yu Hua, Hong jiang, Yifeng Zhu, Dan Feng, Lei Xu
2014 IEEE Transactions on Parallel and Distributed Systems  
Explosive growth in volume and complexity of data exacerbates the key challenge to effectively and efficiently manage data in a way that fundamentally improves the ease and efficacy of their use.  ...  To the best of our knowledge, this is the first work on semantic-sensitive namespace management for ultra-scale file systems.  ...  Parameter Selection The performance of Rapport is sensitive to the parameter settings. One of the key parameters is the metric R that regulates the measure of approximate membership.  ... 
doi:10.1109/tpds.2013.140 fatcat:2zd6qygebvhk7fylw56fsy24au

EARS-DM: Efficient Auto Correction Retrieval Scheme for Data Management in Edge Computing

Kai Fan, Jie Yin, Kuan Zhang, Hui Li, Yintang Yang
2018 Sensors  
With automatic error correction for the query keywords instead of similar words extension, EARS-DM can tolerate spelling mistakes and reduce the complexity of index storage space.  ...  The secure index will be uploaded to the edge computing and the search phrase will be performed by the edge computing which is close to the data source.  ...  Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/s18113616 fatcat:l324dgahhnhbfhz6vkl3tvcssi

Zoom: SSD-based Vector Search for Optimizing Accuracy, Latency and Memory [article]

Minjia Zhang, Yuxiong He
2018 arXiv   pre-print
With the advancement of machine learning and deep learning, vector search becomes instrumental to many information retrieval systems, to search and find best matches to user queries based on their semantic  ...  We develop, Zoom, a new vector search solution that collaboratively optimizes accuracy, latency and memory based on a multiview approach. (1) A "preview" step generates a small set of good candidates,  ...  step on SSDs that reranks the selected NNs from the preview step based on their full-length vectors and selects top-K NNs from the top-R candidates.  ... 
arXiv:1809.04067v1 fatcat:awlttpturbem3f3yvf35t2gn3e

An Orthogonal Multi-Swarm Cooperative PSO Algorithm with a Particle Trajectory Knowledge Base

Jun Yang, Haihua Zhu, Yingcong Wang
2017 Symmetry  
A novel orthogonal multi-swarm cooperative particle swarm optimization (PSO) algorithm with a particle trajectory knowledge base is presented in this paper.  ...  Experiments are conducted on a set of benchmark functions, and the results show its better performance compared with traditional PSO algorithm in aspects of convergence, computational efficiency and avoiding  ...  Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/sym9010015 fatcat:wxh6ikfkv5g4dade6p6v5g4gby

An Extensive Study on Gravitational Search Algorithm

2022 Materials and its Characterization  
Over the course of a decade, researchers have provided many variants of the gravitational search algorithm by modifying its parameters to effectively solve complex optimization problems.  ...  Gravitational search algorithm is a naturally occurring algorithm based on Newton's mathematical model of the law of gravitation and motion.  ...  The search process in GSAs depends on the number of N agents, the maximum number of repetitions kmax, the gravitational constant g (k) and the parameter that has a positive effect on the results of the  ... 
doi:10.46632/mc/1/1/2 fatcat:n7z6uvvstvfqho2gfyxfwgezb4

Approximate Nearest Neighbor Search on High Dimensional Data --- Experiments, Analyses, and Improvement (v1.0) [article]

Wen Li, Ying Zhang, Yifang Sun, Wei Wang, Wenjie Zhang, Xuemin Lin
2016 arXiv   pre-print
In this paper, we conduct a comprehensive experimental evaluation of many state-of-the-art methods for approximate nearest neighbor search.  ...  Furthermore, we propose a new method that achieves both high query efficiency and high recall empirically on majority of the datasets under a wide range of settings.  ...  of points belonging to one of the code word in C are examined via the inverted index.  ... 
arXiv:1610.02455v1 fatcat:skn6iftztnhr7d524fqvyqix3m

The Prediction of Human Abdominal Adiposity Based on the Combination of a Particle Swarm Algorithm and Support Vector Machine

Xiue Gao, Wenxue Xie, Shifeng Chen, Junjie Yang, Bo Chen
2020 International Journal of Environmental Research and Public Health  
) based on BIA.  ...  Firstly, the optimal boundary C and parameter gamma were optimized by the particle swarm algorithm.  ...  Author Contributions: W.X. and X.G. took part in the planning of the project, data analysis, and writing the paper. J.Y. and S.C. participated in the planning of the project and data collection.  ... 
doi:10.3390/ijerph17031117 pmid:32050578 pmcid:PMC7037155 fatcat:y46j72werjhvjgbp3ddgdbhqzm

Partitioned multi-indexing

Bahman Bahmani, Ashish Goel
2012 Proceedings of the 21st international conference on World Wide Web - WWW '12  
With m links in the network, after an offlineÕ(m) pre-processing time, our scheme allows for social index operations (i.e., social search queries, as well as insertion and deletion of words into and from  ...  In this paper, we present the "Partitioned Multi-Indexing" scheme, which provides an approximate solution to this problem.  ...  This will result in a very fast search algorithm at query time. We will, furthermore, show that our index allows for very fast incremental updates upon addition or deletion of words.  ... 
doi:10.1145/2187836.2187891 dblp:conf/www/BahmaniG12 fatcat:divs47skjvbtzmyczn7pammcmu
« Previous Showing results 1 — 15 out of 13,842 results