检索结果-内蒙古大学图书馆

Effective Stemmers Using trie data structure for Enhanced Processing of Gujarati Text

INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS 2024年第1期17卷 1-21页

作者： Dave, Nakul R. Mehta, Mayuri A. Kotecha, Ketan Vishwakarma Govt Engn Coll Dept Comp Engn Ahmadabad Gujarat India Sarvajanik Coll Engn & Technol Dept Comp Engn Surat India Symbiosis Int Univ Symbiosis Inst Technol Symbiosis Ctr Appl Artificial Intelligence Pune 411045 India

Stemming plays a crucial role in natural language processing and information retrieval. It is challenging for the Gujarati language due to the complex morphology of several stemming algorithms for the Gujarati language that have been developed using rule-based, dictionary-based, or hybrid approaches. However, they are computationally expensive, produce more over-stemming errors and have limited accuracy. This paper introduces three novel optimized Gujarati stemmers using a trie data structure to overcome the above-mentioned limitations. The significant contributions to this paper are as follows. First, three optimized Gujarati stemmers, namely Optimized Gujarati Stemmer using Suffix Stripping Approach (OGS_SSA), Optimized Gujarati Stemmer using Rule-Based Approach (OGS_RBA), and Optimized Gujarati Stemmer using Re-parsing Based Approach (OGS_RPA), are proposed. Second, a novel algorithm to create a Gujarati dictionary using the trie data structure is proposed. Third, the proposed stemmers are rigorously assessed using three standard datasets, namely entertainment, health, and agriculture. The performance of the proposed stemmers is measured using evaluation parameters such as precision, recall, F1 score, accuracy, number of stemming errors and processing time. The results show that OGS_RPA consistently exceeds the OGS_SSA and OGS_RBA for precision, recall, F1 score, and accuracy. In addition, it exhibits a lower number of stemming errors. Moreover, the performance of the proposed stemmer is compared with the existing Gujarati hybrid stemmer. The results show a 14-16% improvement in accuracy and less processing time compared to the Gujarati hybrid stemmer. OGS_SSA demonstrated enhanced processing time, making it a feasible option for applications that prioritize prompt response time. Furthermore, it demonstrates 10-11% enhancement in accuracy and a reduction in processing time than the Gujarati hybrid stemmer. OGS_RBA exhibits moderate performance due to its rule-bas

关键词： Natural language processing Information retrieval Stemming Rule-based stemmer Suffix-stripping Based stemmer Reparsing-based stemmer Over-stemming error Under-stemming error Gujarati stemmer Optimized stemmer trie data structure

来源：评论

学校读者我要写书评

暂无评论

Multiset-trie data structure

引用

ALGORITHMS 2023年第3期16卷

作者： Akulich, Mikita Savnik, Iztok Krnc, Matjaz Skrekovski, Riste Univ Primorska Fac Math Nat Sci & Informat Technol Koper 6000 Slovenia Fac Informat Studies Novo Mesto 8000 Slovenia Univ Ljubljana Fac Math & Phys Dept Math Ljubljana 1000 Slovenia

This paper proposes a new data structure, multiset-trie, that is designed for storing and efficiently processing a set of multisets. Moreover, multiset-trie can operate on a set of sets without efficiency loss. The multiset-trie structure is a search tree with properties similar to those of a trie. It implements all standard search tree operations together with the multiset containment operations for searching sub-multisets and super-multisets. Suppose that we have a set of multisets S and a multiset X. The multiset containment operations retrieve multisets from S that are either sub-multisets or super-multisets of X. We present the mathematical analysis of a multiset-trie that gives the time complexity of the algorithms and the space complexity of the data structure. Further, the empirical analysis of the data structure is implemented in a series of experiments. The experiments illuminate the time complexity space of the multiset containment operations.

关键词： trie data structure multiset containment queries

来源：评论

学校读者我要写书评

暂无评论

Generating Signature for Application Inference Using trie data structure

Generating Signature for Application Inference Using Trie Da...

引用

2014 International Conference on Computer,Network Security and Communication Engineering(CNSCE 2014)

作者： Jian-zhen LUO Shun-zheng YU Man LI School of Information Science and Technology Sun Yat-Sen University

Generating effective and efficient signature of applications plays a significant role in network traffic classification and application inference. In this paper, we propose a novel approach to generate probabilistic signature for application inference using trie data structure. We implement our approach into a tool called Prob trieS ig. Meanwhile, we also implement another two related systems based on the Markov Model and Production Distribution Model. In the phase of signature evaluation, constructed signatures are applied to classify real world traffic and the results are compared with those of the two related systems. The experimental results show that Prob trieS ig outperforms the other two comparison systems based on Markov and Production Distribution Model.

关键词： trie data structure Application Signature Traffic Classification

来源：评论

学校读者我要写书评

暂无评论

Two-level massive string dictionaries

引用

INFORMATION SYSTEMS 2025年 128卷

作者： Ferragina, Paolo Rotundo, Mariagiovanna Vinciguerra, Giorgio Univ Pisa Dept Comp Sci Lgo B Pontecorvo 3 I-56127 Pisa PI Italy

We study the problem of engineering space-time efficient data structures that support membership and rank queries on very large static dictionaries of strings. Our solution is based on a very simple approach that decouples string storage and string indexing by means of a block-wise compression of the sorted dictionary strings (to be stored in external memory) and a succinct implementation of a Patricia trie (to be stored in internal memory) built on the first string of each block. On top of this, we design an in-memory cache that, given a sample of the query workload, augments the Patricia trie with additional information to reduce the number of I/Os of future queries. Our experimental evaluation on two new datasets, which are at least one order of magnitude larger than the ones used in the literature, shows that (i) the state-of-the-art compressed string dictionaries, compared to Patricia tries, do not provide significant benefits when used in a large-scale indexing setting, and (ii) our two-level approach enables the indexing and storage of 3.5 billion strings taking 273 GB in just less than 200 MB of internal memory and 83 GB of compressed disk space, while still guaranteeing comparable or faster query performance than those offered by array-based solutions used in modern storage systems, such as RocksDB, thus possibly influencing their future design.

关键词： String dictionary problem trie data structure String compression Algorithm engineering Key-value stores

来源：评论

学校读者我要写书评

暂无评论

Implementing the Davis-Putnam method

引用

JOURNAL OF AUTOMATED REASONING 2000年第1-2期24卷 277-296页

作者： Zhang, HT Stickel, M Univ Iowa Dept Comp Sci Iowa City IA 52242 USA SRI Int Ctr Artificial Intelligence Menlo Pk CA 94025 USA

The method proposed by Davis, Putnam, Logemann, and Loveland for propositional reasoning, often referred to as the Davis-Putnam method, is one of the major practical methods for the satisfiability (SAT) problem of propositional logic. We show how to implement the Davis-Putnam method efficiently using the trie data structure for propositional clauses. A new technique of indexing only the first and last literals of clauses yields a unit propagation procedure whose complexity is sublinear to the number of occurrences of the variable in the input. We also show that the Davis-Putnam method can work better when unit subsumption is not used. We illustrate the performance of our programs on some quasigroup problems. The efficiency of our programs has enabled us to solve some open quasigroup problems.

关键词： propositional satisfiability Davis-Putnam method trie data structure

来源：评论

学校读者我要写书评

暂无评论

Detection and Mitigation of Denial of Service Attacks Using Stratified Architecture 4

Detection and Mitigation of Denial of Service Attacks Using ...

引用

4th International Conference on Recent Trends in Computer Science and Engineering (ICRTCSE)

作者： Prakash, A. Satish, M. Bhargav, T. Sri Sai Bhalaji, N. SSN Coll Engn Dept Informat Technol Chennai 603110 Tamil Nadu India

Denials of Service (DoS) attacks are one of the major threats and areconsidered as one of the hardest problem in the internet today. Another variant of this is the Distributed Denial of Service (DDos) which is even more powerful because of its distributive nature. The main objective of this article is to prevent or protect a machine from being affected from these attacks. This article consists of a series of Denial of Service attacks on a target machine and proposes an algorithm which prevents Dos attacks. This algorithm has three(3) layers through which the requesting client goes through for efficient authentication. (C) 2016 The Authors. Published by Elsevier B.V.

关键词： Denial of service(Dos) Distributed Denial of Service (DDos) Layered Approach trie data structure

来源：评论

学校读者我要写书评

暂无评论

Engineering a Textbook Approach to Index Massive String Dictionaries 1

引用

30th International Symposium on String Processing and Information Retrieval (SPIRE) / 18th Workshop on Compression, Text, and Algorithms (WCTA)

作者： Ferragina, Paolo Rotundo, Mariagiovanna Vinciguerra, Giorgio Univ Pisa Dept Comp Sci Pisa Italy

ISBN: (数字)9783031439803

ISBN: (纸本)9783031439797;9783031439803

We study the problem of engineering space-time efficient indexes that support membership and lexicographic (rank) queries on very large static dictionaries of strings. Our solution is based on a very simple approach that consists of decoupling string storage and string indexing by means of a blockwise compression of the sorted dictionary strings (to be stored in external memory) and a succinct implementation of a Patricia trie (to be stored in internal memory) built on the first string of each block. Our experimental evaluation on two new datasets, which are at least one order of magnitude larger than the ones used in the literature, shows that (i) the state-of-the-art compressed string dictionaries (such as FST, PDT, CoCo-trie) do not provide significant benefits if used in an indexing setting compared to Patricia tries, and (ii) our two-level approach enables the indexing of 3.5 billion strings taking 273 GB in less than 200 MB of internal memory, which is available on any commodity machine, while still guaranteeing comparable or faster query performance than those offered by array-based solutions used in modern storage systems, such as RocksDB, thus possibly influencing their future designs.

关键词： String dictionary problem trie data structure String compression Algorithm engineering Key-value store

来源：评论

学校读者我要写书评

暂无评论

Interactome: A Platform for Comprehensive Drug-Drug Interaction Analysis 15

Interactome: A Platform for Comprehensive Drug-Drug Interact...

引用

15th International Conference on Computing Communication and Networking Technologies, ICCCNT 2024

作者： Sivakumar, Amrutha Bhanot, Shreya Srinidhi, M. Aiswariya Milan, K. Amrita Vishwa Vidyapeetham Amrita School of Computing Department of Computer Science & Engineering Bengaluru India

ISBN: (纸本)9798350370249

Drug-drug interaction is an important aspect to be taken into consideration when administering multiple drugs to patients with severe diseases. It is important to know if the combination of the drugs causes a positive effect or an ill effect on the person's body. Thus, Interactome roots to offer a comprehensive solution to assess and find out the interactions between commonly used drugs for the treatment of different ailments such as heart diseases or diabetes and provides an understanding of how the combination of these drugs can cause side effects if not provided with enough details about the drug. Thus, it enables the user to know alternatives to using efficient drugs without any side effects by displaying graphs of the percentage of positive and negative effects and charts depicting the effects. By providing negative and positive feedback on the combination of various drugs used for heart and diabetes patients and displaying the percentage risks with the help of graphs and charts, Interactome ensures the prevention of any unnecessary attacks. Also, it saves the lives of an individual by spreading awareness about drug-drug interactions. We incorporate a trie data structure that efficiently analyzes the input medications against a database of known interactions. It optimizes the retrieval process by organizing the drugs into a hierarchical structure. Then it ensures rapid and accurate results so that healthcare professionals and individuals receive timely and comprehensive insights into potential drug interactions. © 2024 IEEE.

关键词： charts Drug-drug interaction graphs negative effects positive effects trie data structure

来源：评论

学校读者我要写书评

暂无评论

Finding Experts in Community Question Answering System Using trie String Matching Algorithm with Domain Knowledge

引用

IETE JOURNAL OF RESEARCH 2024年第3期70卷 2602-2614页

作者： Menaha, R. Jayanthi, V. E. Sri Eshwar Coll Engn Dept IT Coimbatore Tamilnadu India PSNA Coll Engn & Technol Dept ECE Dindigul Tamilnadu India

In recent days, different community question-answering systems have been evolving as online forums for knowledge sharing among users across the world. However, finding experts on the questions is a key issue in the community question-answering system. To address this issue, a novel approach is proposed in this paper for finding experts from the community question-answering website using an exact string-matching algorithm along with domain knowledge. The proposed system is designed with three phases: i) User Profile Modeling, ii) Question Preprocessing, and iii) Expert Recommendation. Initially, the matrix factorization model is adopted for user profile modeling where the tags and the answerer's information are represented in the form of a matrix. Then, the domain-wise grouping of tags is done to minimize the search time of the tags. The question preprocessing is done using a keyword extraction algorithm to extract the keywords. Finally, the expert recommendation is accomplished using the trie string matching algorithm and key-value mapping process. For doing experiments, a stack overflow community question-answering website is utilized in this work. The performance of the system is measured and the results section proved that the system achieved 91.2% accuracy.

关键词： Community question answering domain-wise experts exact string matching finding experts key-value mapping trie data structure

来源：评论

学校读者我要写书评

暂无评论

Detection and Mitigation of Denial of Service Attacks Using Stratified Architecture

引用

Procedia Computer Science 2016年 87卷 275-280页

作者： A. Prakash M. Satish T. Sri Sai Bhargav N. Bhalaji Department of Information Technology SSN College of Engineering Kalavakkam Chennai 603 110

关键词： Denial of service(Dos) Distributed Denial of Service (DDos) Layered Approach trie data structure

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：