A review: search visualization with Knuth Morris Pratt algorithm
01 Sep 2017-Vol. 237, Iss: 1, pp 012026
TL;DR: This research modeled a search process of the Knuth-Morris-Pratt algorithm in the form of easy-to-understand visualization, Knuth/Morris algorithm selection because this algorithm is easy to learn and easy to implement into many programming languages.
Abstract: In this research modeled a search process of the Knuth-Morris-Pratt algorithm in the form of easy-to-understand visualization, Knuth-Morris-Pratt algorithm selection because this algorithm is easy to learn and easy to implement into many programming languages.
Citations
More filters
TL;DR: The use of expert systems with the search model with the Fuzzy Mamdani method can help to know the condition of the disease that may be suffered by each individual based on the pattern of life that he did.
Abstract: The importance of health for everyone to be able to empower everything that is owned and the environment maximally, health is closely related to healthy living. So that can be described the meaning of healthy life is to have health in life with no problems of disruption in life both physical in the form of disease in the body and non-physical that is related to the condition of the soul, heart and mind of a person in life both individually and socially. The use of expert systems with the search model with the Fuzzy Mamdani method can help to know the condition of the disease that may be suffered by each individual based on the pattern of life that he did.
32 citations
Additional excerpts
...Expert system is part of the concept of Artificial Intelligence where its work still uses searching concept to examine and find like search algorithms that use concept of Artificial Intelligence such as Depth-First Search[18], Breadth-First Search[19], BoyerMoore[20], Knuth-Morris-Pratt[21] and search algorithms others....
[...]
TL;DR: The system has been built that shows the results of good performance and minimal error in view of the system that is able to distinguish the anomaly traffic with normal traffic.
Abstract: Data Mining is a process of exploring against large data to find patterns in decision making. One of the techniques in decision-making is classification. Classification is a technique in data mining by applying decision tree method to form data, algorithm C4.5 is algorithm that can be used to classify data in tree form. The system has been built that shows the results of good performance and minimal error in view of the system that is able to distinguish the anomaly traffic with normal traffic. Data mining inventory system applications can facilitate the control of inventory in the company to reduce production costs.
28 citations
Cites methods from "A review: search visualization with..."
...5 algorithm as data classification process will simplify the process of grouping and searching process[13]–[16], it is expected that this algorithm can be a solution to process inventory data...
[...]
TL;DR: In this research method used is TOPSIS Method and Method of Fuzzy Logic, one of multiple criteria decision making method that uses the principle that the alternatives selected must have the shortest distance.
Abstract: Decision Support System is an interactive system that supports decision in the decision-making process through alternatives derived from the processing of data, information and design of the models. Selection decision support system of chemical fertilizer in fruit plant is expected to help anyone who wants to cultivate fruit trees can determine the chemical fertilizer as expected based alternatives and criteria set by the user. In this research method used is TOPSIS Method and Method of Fuzzy Logic. TOPSIS method is one of multiple criteria decision making method that uses the principle that the alternatives selected must have the shortest distance. Fuzzy Logic is a methodology of control systems troubleshooting, the fuzzy logic stated that everything is a binary which means it is only two possibilities, \"Yes or No\", \"True or False\", \"Good or Bad\", and others. Therefore, all of these can have a membership value of 0 or 1.
23 citations
01 Apr 2018
TL;DR: Raita algorithm applied to the file search application using java programming language and the results obtained from the testing process of thefile search quickly and with accurate results and support many data types.
Abstract: Searching is a common process performed by many computer users, Raita algorithm is one algorithm that can be used to match and find information in accordance with the patterns entered. Raita algorithm applied to the file search application using java programming language and the results obtained from the testing process of the file search quickly and with accurate results and support many data types.
19 citations
TL;DR: A prototype hate speech detection application created to detect hate speech on Facebook and it can give notification to users to be more aware of social media content and also careful in reading, share content that can trigger unpleasant actions.
Abstract: Hate speech is now a problem for social media users such as Facebook, Twitter, Whatsapp and also Telegram. The current social media users are also a lot to post, share the content both consciously and unconsciously to various social media as well as even some hate speech postings are shared by irresponsible parties to gain profit from the chaos that he created, denigrating religion, vilify certain individuals even as an act of provocation. Prototype hate speech detection application created to detect hate speech on Facebook and it can give notification to users to be more aware of social media content and also careful in reading, share content that can trigger unpleasant actions.
15 citations
Cites background from "A review: search visualization with..."
...cannot check facebook on smartphone, string matching algorithm[11]–[13] and searching algorithm[14]–[20] can parse website content containing information before the website is fully read by the user then the application can detect and take action...
[...]
References
More filters
TL;DR: A bitwise KMP algorithm is proposed that can move one extra bit in the case of a mismatch since the alphabet is binary, and two practical Huffman decoding schemes which handle more than a single bit per machine operation are combined.
Abstract: In the present work we perform compressed pattern matching in binary Huffman encoded texts [Huffman, D. (1952). A method for the construction of minimum redundancy codes, Proc. of the IRE, 40, 1098-1101]. A modified Knuth-Morris-Pratt algorithm is used in order to overcome the problem of false matches, i.e., an occurrence of the encoded pattern in the encoded text that does not correspond to an occurrence of the pattern itself in the original text. We propose a bitwise KMP algorithm that can move one extra bit in the case of a mismatch since the alphabet is binary. To avoid processing any bit of the encoded text more than once, a preprocessed table is used to determine how far to back up when a mismatch is detected, and is defined so that we are always able to align the start of the encoded pattern with the start of a codeword in the encoded text. We combine our KMP algorithm with two practical Huffman decoding schemes which handle more than a single bit per machine operation; skeleton trees defined by Klein [Klein, S. T. (2000). Skeleton trees for efficient decoding of huffman encoded texts. Information Retrieval, 3, 7-23], and numerical comparisons between special canonical values and portions of a sliding window presented in Moffat and Turpin [Moffat, A., & Turpin, A. (1997). On the implementation of minimum redundancy prefix codes. IEEE Transactions on Communications, 45, 1200-1207]. Experiments show rapid search times of our algorithms compared to the "decompress then search" method, therefore, files can be kept in their compressed form, saving memory space. When compression gain is important, these algorithms are better than cgrep [Ferragina, P., Tommasi, A., & Manzini, G. (2004). C Library to search over compressed texts, http://roquefort.di.unipi.it/~ferrax/CompressedSearch], which is only slightly faster than ours.
28 citations
TL;DR: From the experimental results, it is realized that the enhanced KMP algorithm gives better accuracy compared to other string matching algorithms.
Abstract: Objectives: To retrieve the information after analyzing the contents of the documents which are stored in the desktop by applying string matching algorithms. Methods/Statistical Analysis: To analyze the content of the documents, the various pattern matching algorithms are used to find all the occurrences of a limited set of patterns within an input text or input document. In order to perform this task, this research work used four existing string matching algorithms; they are Brute Force algorithm, Knuth-Morris-Pratt algorithm (KMP), Boyer Moore algorithm and Rabin Karp algorithm. This work also proposes three new string matching algorithms. They are Enhanced Boyer Moore algorithm, Enhanced Rabin Karp algorithm and Enhanced Knuth-Morris-Pratt algorithm. Findings: For experimentation, this work has used two types of documents, i.e. .txt and .docx. Performance measures used are search time, number of iterations and accuracy. From the experimental results, it is realized that the enhanced KMP algorithm gives better accuracy compared to other string matching algorithms. Application/Improvements: Normally, these algorithms are used in the field of text mining, document classification, content analysis and plagiarism detection. In future, these algorithms have to be enhanced to improve their performance and the various types of documents will be used for experimentation.
11 citations
TL;DR: This paper applies bi-directional searching mechanism in exact string matching algorithms: Boyer Moore, Brute Force, KnuthMorris Pratt, and Rabin Karp to show better efficiency of these string matching algorithm.
Abstract: String matching is an important problem in computer science having several practical applications. In this paper, we apply bi-directional searching mechanism in exact string matching algorithms: Boyer Moore, Brute Force, KnuthMorris Pratt, and Rabin Karp. Experiments show that this strategy leads to better efficiency of these string matching algorithm.
7 citations
01 Jan 2012
TL;DR: The main goal of this paper is to reduce the search time when the KMP algorithm is implemented in a parallel mechanism.
Abstract: In our paper we will try to implement the parallel techniques in Knuth–Morris–Pratt string searching algorithm ( KMP algorithm) for search about Arabic language text, Before that we will try to implement a Pre-processing processes in Arabic text (stemming Arabic text) to prepare the text to using it for KMP search algorithm in parallelism .the main goal of our paper to reduce the search time when we implement the KMP algorithm in a parallel mechanism, We describe the steps for our propose model in paper sections.
7 citations
Journal Article•
TL;DR: The benefits of parallelizing 7 state-of-the-art systems are explored and the costs are explored.
Abstract: and Figures We explore the benefits of parallelizing 7 state-of-the-art
6 citations