121,432 Hits in 7.5 sec

Multi-Pattern Boyer-Moore - Horspool Algorithm based Hashing Function for Intrusion Detection System

Awsan A. Hasan, Nur' Aini Abdul Rashid, Muhannad A. Abu-Hashem, Atheer A. Abdulrazzaq
2013 Lecture Notes on Information Theory  
The developed algorithm is able to reduce the matching time because it can compare a group of pattern at one time.  ...  In this paper, we continue to developing Boyer-Moore Horspool algorithm by adding a new multi-pattern hashing feature to its original structure, which is called MPH-BMH.  ...  Boyer-Moore algorithm (BM) is an exact string matching algorithm based on a single pattern matching [12] .  ... 
doi:10.12720/lnit.1.2.69-72 fatcat:k5mpd4vduvgrtlxcs6fldbx6hy

Hierarchical multi-pattern matching algorithm for network content inspection

Tzu-Fang Sheu, Nen-Fu Huang, Hsiao-Ping Lee
2008 Information Sciences  
This paper proposes a novel hierarchical multi-pattern matching algorithm (HMA) for packet inspection.  ...  The most important technology for fast packet inspection is an efficient multi-pattern matching algorithm to perform exact string matching between packets and a large set of patterns.  ...  For single-pattern searching, the table size of BM-based algorithms is O(jKj). However, for multi-pattern matching, the table size of BM-based algorithms rises significantly to O(jPj  jKj).  ... 
doi:10.1016/j.ins.2008.03.006 fatcat:fjpbbey7affnfib6u7vkn5ulie

Reducing Payload Inspection Cost Using Rule Classification for Fast Attack Signature Matching

Sunghyun KIM, Heejo LEE
2009 IEICE transactions on information and systems  
Based on IDS rule analysis, we grouped the signatures of attack rules by a multi-dimensional classification method adapted to a simplified address flow.  ...  In this paper, we propose new methods to classify attack signatures and make pre-computed multipattern groups.  ...  The well-known Aho-Corasick (AC) algorithm [7] preprocesses the set of patterns, to construct a pattern matching machine based on a deterministic finite automaton (DFA).  ... 
doi:10.1587/transinf.e92.d.1971 fatcat:gtok2vsomjd37kk3wfczghjkci

Domain Priori Knowledge based Integrated Solution Design for Internet of Services [article]

Hanchuan Xu, Xiao Wang, Yuxin Wang, Nan Li, Zhiying Tu, Zhongjie Wang, Xiaofei Xu
2020 arXiv   pre-print
Priori knowledge is classified into three types: requirement patterns (RPs), service patterns (SPs), and probabilistic matching matrix (PMM) between RPs and SPs.  ...  Interconnections among these services have resulted in a new phenomenon called "Internet of Services" (IoS).  ...  Service Pattern Service pattern(SP) refers to a complete or partial ISS that is frequently used in a specific domain and has a business process, service activities, and service resources.  ... 
arXiv:2009.02065v1 fatcat:kcfsipufvnfzto23536k7ik3ya

Relevance Mining of Multi-Keyword Search to Originate Initial Cluster Centers for K-Means Algorithm

Zhaoyang Qu, Wei Ding, Tiehua Zhou, Nan Qu, Ling Wang, Hongbo Lv
2017 International Journal of Multimedia and Ubiquitous Engineering  
In this paper, a novel method is proposed to address the initial cluster centers problem in k-means algorithm based on relevance mining of multi-keyword search.  ...  In proposed work, the initial cluster centers have obtained using frequent pattern for each keyword and after that k-means algorithm is applied to gain optimal cluster centers in database.  ...  The proposed method initializes multi-keyword for k-means algorithm based on relevance mining of frequent pattern.  ... 
doi:10.14257/ijmue.2017.12.3.06 fatcat:crjvcdqy6rdqxhssyh3fswhnce


Siti Sakira Kamaruddin, Yuhanis Yusof, Husniza Husni, Mohammad Hayel Al Refai
2016 Jurnal Teknologi  
In stage one the frequent pattern are represented using a proposed vertical data format to reduce the text dimensionality problem and in stage two the generated rule was pruned using a proposed Partial  ...  This paper presents text classification using a modified Multi Class Association Rule Method.  ...  Hence we proposed a rule pruning method based on partially rule match (PRM).  ... 
doi:10.11113/jt.v78.9553 fatcat:6cbyspzh6jfbdmgbamtxavgacq

Efficient Mining of Frequent Subgraphs with Two-Vertex Exploration [article]

Peng Jiang, Rujia Wang, Bo Wu
2021 arXiv   pre-print
We further enhance the performance through an index-based quick pattern technique that reduces the overhead of isomorphism checks, and a subgraph sampling technique that mitigates the issue of subgraph  ...  In this work, we propose a novel two-vertex exploration strategy to accelerate the mining process.  ...  Peregrine [15] maintains a list of frequent patterns, extend the patterns with one vertex or edge, and then re-match the extended patterns on the graph.  ... 
arXiv:2101.07690v2 fatcat:e3ihtvl6offm3azj7tsfyrmufa

DanceTrack: Multi-Object Tracking in Uniform Appearance and Diverse Motion [article]

Peize Sun, Jinkun Cao, Yi Jiang, Zehuan Yuan, Song Bai, Kris Kitani, Ping Luo
2022 arXiv   pre-print
A typical pipeline for multi-object tracking (MOT) is to use a detector for object localization, and following re-identification (re-ID) for object association.  ...  We expect DanceTrack to provide a better platform to develop more MOT algorithms that rely less on visual discrimination and depend more on motion analysis.  ...  We would also like to thank Vivek Roy, Pedro Morgado, Shuyang Sun for their proof reading and suggestions on paper writing. This work was sponsored in part by NSF NRI Award IIS2024173.  ... 
arXiv:2111.14690v3 fatcat:eccbcgkftjd5hjvrmd3gh2jeoi

Predicting the next location change and time of change for mobile phone users

Mert Ozer, Ilkcan Keles, İsmail Hakki Toroslu, Pinar Karagoz, Salih Ergut
2014 Proceedings of the Third ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems - MobiGIS '14  
technique to extract frequent movement patterns to predict the change of the region of the user and its time frame.  ...  Our method has two steps, namely clustering the spatial data into larger regions and grouping temporal data into time intervals to get higher granularity levels, and then, applying sequential pattern mining  ...  In [3] , Cao et al. introduce a method for discovering periodic patterns in spatio-temporal sequences. They also make use of an AprioriAll-based algorithm for extraction of periodic patterns.  ... 
doi:10.1145/2675316.2675318 dblp:conf/gis/OzerKTKE14 fatcat:vl7e7gbuiffr5i4frrrum2x3ym

DFC: Accelerating String Pattern Matching for Network Applications

Byungkwon Choi, Jongwook Chae, Muhammad Jamshed, KyoungSoo Park, Dongsu Han
2016 Symposium on Networked Systems Design and Implementation  
to the Proceedings of the 13th USENIX Symposium on Networked Systems Design and Implementation (NSDI '16) is sponsored by USENIX.  ...  This work was supported by IITP granted by the Korea government (MSIP) [B0126-15-1078, Creation of PEP based on automatic protocol behavior analysis and Resource management for hyper connected for IoT  ...  We also thank Huy Hoang for his help on testing.  ... 
dblp:conf/nsdi/ChoiCJPH16 fatcat:42kmybmtrvc6zettbbupqldntm

Centralized Parallel Form of Pattern Matching Algorithm in Packet Inspection by Efficient Utilization of Secondary Memory in Network Processor [chapter]

N. Kannaiya Raja, K. Arulanandam, B. RajaRajeswari
2012 Communications in Computer and Information Science  
By presenting centralized parallel pattern matching algorithm for efficient packet inspection with network processor and coprocessor in order to retrieve the pattern with less time.  ...  The high level network equipment provides in-depth packet inspection through pattern matching in network detection system.  ...  THE CENTRALIZED MUTI PARALLEL PATTERN MATCHING ALGORTITHM (CNMPPMA) In the Centralized Multi Parallel Pattern Matching Algorithm(CNMPPMA) is a centralized system based on a multi-tier and cluster-wise  ... 
doi:10.1007/978-3-642-29219-4_76 fatcat:z5a6mijb4rewvj42fvi6u6naca

A Review: Data mining over Multi-Relations

Deepak Meena, Hitesh Gupta
2013 International Journal of Computer Applications  
Multi-relational data mining algorithms directly extract frequent patterns from different registers in efficient manner without need of transfer the data in a single table will, on the other hand, used  ...  The paper provides the overview of multi relation data mining techniques and classification algorithms. It also defines the frequent pattern mining.  ...  A new frequent pattern mining algorithm [8] , called LPS-Miner, which bases the pattern growth principle and uses two new data structures, LPS-FP-Tree (Light Partial-Support FP-Tree) and LPS-Forest (Light  ... 
doi:10.5120/10104-4756 fatcat:7qk4bjyaivejxj64ws22qyhxsu

Fast and Memory-Efficient Traffic Classification with Deep Packet Inspection in CMP Architecture

Tingwen Liu, Yong Sun, Li Guo
2010 2010 IEEE Fifth International Conference on Networking, Architecture, and Storage  
In order to reduce the memory usage of DFA, we use a compression algorithm called CSCA to perform regular expressions matching, which can reduce 95% memory usage of DFA.  ...  previous one-layer architecture.  ...  We design a new load balancing algorithm based on static preallocation and adaptive adjustments, which could be used in network flow-based parallel processing system in CMP architecture.  ... 
doi:10.1109/nas.2010.43 dblp:conf/nas/LiuSG10 fatcat:4w3i67ejyfdmppejmi4ap5nn24

Mining frequent patterns from network flows for monitoring network

Xin Li, Zhi-Hong Deng
2010 Expert systems with applications  
of algorithms that contains vertical re-mining algorithm, multi-pattern re-mining algorithm, fast multi-pattern capturing algorithm and fast multi-pattern capturing supplement algorithm to deal with a  ...  So the research in this paper not only provides a new application area for frequent pattern mining, but also provides a new technique for network monitoring. Crown  ...  Based on this supposition, we can omit the new multi-patterns combined by all old frequent 1-patterns.  ... 
doi:10.1016/j.eswa.2010.06.012 fatcat:gkiwovlo6fhapn3oowpyxhg7nq

Hyperscan: A Fast Multi-pattern Regex Matcher for Modern CPUs

Xiang Wang, Yang Hong, Harry Chang, KyoungSoo Park, Geoff Langdale, Jiayu Hu, Heqing Zhu
2019 Symposium on Networked Systems Design and Implementation  
Second, Hyperscan accelerates both string and finite automata matching using SIMD operations, which brings substantial throughput improvement.  ...  In this paper, we present Hyperscan, a high performance regular expression matcher for commodity server machines. Hyperscan employs two core techniques for efficient pattern matching.  ...  Then, we run the following algorithm that calculates the minimum cost of grouping the patterns into n buckets using dynamic programming.  ... 
dblp:conf/nsdi/WangHCPLHZ19 fatcat:rcqqumxm3balpfz2xrju76kcmi
« Previous Showing results 1 — 15 out of 121,432 results