scholarly journals Mining Simple Path Traversal Patterns in Knowledge Graph

2022 ◽  
Author(s):  
Feng Xiong ◽  
Hongzhi Wang
Keyword(s):  
Data Mining ◽  
Pattern Mining ◽  
Divide And Conquer ◽  
Simple Path ◽  
Knowledge Graph ◽  
Sequence Mining ◽  
High Coverage ◽  
List Structure ◽  
Life Force ◽  
Mining Algorithms

The data mining has remained a subject of unfailing charm for research. The knowledge graph is rising and showing infinite life force and strong developing potential in recent years, where it is observed that acyclic knowledge graph has capacity for enhancing usability. Though the development of knowledge graphs has provided an ample scope for appearing the abilities of data mining, related researches are still insufficient. In this paper, we introduce path traversal patterns mining to knowledge graph. We design a novel simple path traversal pattern mining framework for improving the representativeness of result. A divide-and-conquer approach of combining each path is proposed to discover the most frequent traversal patterns in knowledge graph. To support the algorithm, we design a linked list structure indexed by the length of sequences with handy operations. The correctness of algorithm is proven. Experiments show that our algorithm reaches a high coverage with low output amounts compared to existing frequent sequence mining algorithms.

Clustering of Time Series Data

2011 ◽  
pp. 258-263
Author(s):  
Anne Denton
Keyword(s):  
Data Mining ◽  
Time Series ◽  
Pattern Mining ◽  
Time Series Data ◽  
Frequent Pattern Mining ◽  
Frequent Pattern ◽  
Series Data ◽  
Science And Engineering ◽  
Data Mining Algorithms ◽  
Mining Algorithms

Time series data is of interest to most science and engineering disciplines and analysis techniques have been developed for hundreds of years. There have, however, in recent years been new developments in data mining techniques, such as frequent pattern mining, that take a different perspective of data. Traditional techniques were not meant for such pattern-oriented approaches. There is, as a result, a significant need for research that extends traditional time-series analysis, in particular clustering, to the requirements of the new data mining algorithms.

scholarly journals Distributed frequent hierarchical pattern mining for robust and efficient large-scale association discovery

2017 ◽  
Author(s):  
◽  
Michael Phinney
Keyword(s):  
Data Mining ◽  
Distributed Computing ◽  
Pattern Mining ◽  
Frequent Pattern Mining ◽  
Frequent Pattern ◽  
Generation Process ◽  
Computing Environment ◽  
Wide Range ◽  
Mining Algorithms ◽  
Hierarchical Pattern

Frequent pattern mining is a classic data mining technique, generally applicable to a wide range of application domains, and a mature area of research. The fundamental challenge arises from the combinatorial nature of frequent itemsets, scaling exponentially with respect to the number of unique items. Apriori-based and FPTree-based algorithms have dominated the space thus far. Initial phases of this research relied on the Apriori algorithm and utilized a distributed computing environment; we proposed the Cartesian Scheduler to manage Apriori's candidate generation process. To address the limitation of bottom-up frequent pattern mining algorithms such as Apriori and FPGrowth, we propose the Frequent Hierarchical Pattern Tree (FHPTree): a tree structure and new frequent pattern mining paradigm. The classic problem is redefined as frequent hierarchical pattern mining where the goal is to detect frequent maximal pattern covers. Under the proposed paradigm, compressed representations of maximal patterns are mined using a top-down FHPTree traversal, FHPGrowth, which detects large patterns before their subsets, thus yielding significant reductions in computation time. The FHPTree memory footprint is small; the number of nodes in the structure scales linearly with respect to the number of unique items. Additionally, the FHPTree serves as a persistent, dynamic data structure to index frequent patterns and enable efficient searches. When the search space is exponential, efficient targeted mining capabilities are paramount; this is one of the key contributions of the FHPTree. This dissertation will demonstrate the performance of FHPGrowth, achieving a 300x speed up over state-of-the-art maximal pattern mining algorithms and approximately a 2400x speedup when utilizing FHPGrowth in a distributed computing environment. In addition, we allude to future research opportunities, and suggest various modifications to further optimize the FHPTree and FHPGrowth. Moreover, the methods we offer will have an impact on other data mining research areas including contrast set mining as well as spatial and temporal mining.

Comparative Study of Frequent Pattern Mining Techniques

2011 ◽  
Vol 403-408 ◽  
pp. 1022-1027 ◽  
Author(s):  
Gauravjeet Singh ◽  
Sandeep Bal ◽  
Poonamjeet Kaur ◽  
Kanwaljit Kaur
Keyword(s):  
Data Mining ◽  
Comparative Study ◽  
Pattern Mining ◽  
Frequent Pattern Mining ◽  
Frequent Pattern ◽  
Mining Algorithms

Frequent pattern mining has been a focused theme in data mining research. Lots of techniques have been proposed to improve the performance of frequent pattern mining algorithms. This paper presents review of different frequent mining techniques. With each technique, we have provided brief description of the technique. At the end, we compared different frequent pattern mining techniques.

Trajectory Pattern Mining: Methods and Applications

2014 ◽  
Vol 490-491 ◽  
pp. 1361-1367
Author(s):  
Xin Huang ◽  
Hui Juan Chen ◽  
Mao Gong Zheng ◽  
Ping Liu ◽  
Jing Qian
Keyword(s):  
Data Mining ◽  
Social Media ◽  
Pattern Mining ◽  
Data Sets ◽  
Trajectory Data ◽  
Data Mining Algorithms ◽  
Mining Methods ◽  
Trajectory Pattern ◽  
Mining Algorithms ◽  
Trajectory Pattern Mining

With the advent of location-based social media and locationacquisition technologies, trajectory data are becoming more and more ubiquitous in the real world. A lot of data mining algorithms have been successfully applied to trajectory data sets. Trajectory pattern mining has received a lot of attention in recent years. In this paper, we review the most inuential methods as well as typical applications within the context of trajectory pattern mining.

scholarly journals Applications of Data Mining Algorithms for Network Security

2019 ◽  
Author(s):  
Kai Chain
Keyword(s):  
Data Mining ◽  
Network Security ◽  
Intrusion Detection ◽  
Pattern Mining ◽  
Academic Community ◽  
Network Attacks ◽  
Data Mining Algorithms ◽  
Human Effort ◽  
Modern Information ◽  
Mining Algorithms

Typical modern information systems are required to process copious data. Conventional manual approaches can no longer effectively analyze such massive amounts of data, and thus humans resort to smart techniques and tools to complement human effort. Currently, network security events occur frequently, and generate abundant log and alert files. Processing such vast quantities of data particularly requires smart techniques. This study reviewed several crucial developments of existent data mining algorithms, including those that compile alerts generated by heterogeneous IDSs into scenarios and employ various HMMs to detect complex network attacks. Moreover, sequential pattern mining algorithms were examined to develop multi-step intrusion detection. These studies can focus on applying these algorithms in practical settings to effectively reduce the occurrence of false alerts. This article researched the application of data mining algorithms in network security. The academic community has recently generated numerous studies on this topic.

scholarly journals Preference-Based Frequent Pattern Mining

2008 ◽  
pp. 1280-1299
Author(s):  
Moonjung Cho ◽  
Jian Pei ◽  
Haixun Wang ◽  
Wei Wang
Keyword(s):  
Data Mining ◽  
General Framework ◽  
Pattern Mining ◽  
Frequent Pattern Mining ◽  
Frequent Pattern ◽  
Frequent Patterns ◽  
Performance Study ◽  
Important Data ◽  
Mining Algorithms ◽  
Extensive Performance

Frequent pattern mining is an important data-mining problem with broad applications. Although there are many in-depth studies on efficient frequent pattern mining algorithms and constraint pushing techniques, the effectiveness of frequent pattern mining remains a serious concern: It is non-trivial and often tricky to specify appropriate support thresholds and proper constraints. In this paper, we propose a novel theme of preference-based frequent pattern mining. A user simply can specify a preference instead of setting detailed parameters in constraints. We identify the problem of preference-based frequent pattern mining and formulate the preferences for mining. We develop an efficient framework to mine frequent patterns with preferences. Interestingly, many preferences can be pushed deep into the mining by properly employing the existing efficient frequent pattern mining techniques. We conduct an extensive performance study to examine our method. The results indicate that preference-based frequent pattern mining is effective and efficient. Furthermore, we extend our discussion from pattern-based frequent pattern mining to preference-based data mining in principle and draw a general framework.

scholarly journals Frequent Pattern Mining over Unstructured Data using Semi-Structured Doc-Model and Pattern Ranking

2020 ◽  
pp. 36-42
Author(s):  
Sudhir Tirumalasetty ◽  
A. Divya ◽  
D. Rahitya Lakshmi ◽  
Ch. Durga Bhavani ◽  
D. Anusha
Keyword(s):  
Data Mining ◽  
Big Data ◽  
Pattern Mining ◽  
Frequent Pattern Mining ◽  
Unstructured Data ◽  
Frequent Pattern ◽  
Frequent Patterns ◽  
Innovative Methods ◽  
Mining Algorithms ◽  
Doc Model

Frequent pattern mining is an essential data-mining task, with a goal of discovering knowledge in the form of repeated patterns. Many efficient pattern-mining algorithms have been discovered in the last two decades, yet most do not scale to the type of data we are presented with today, the so-called “Big Data”. Scalable parallel algorithms hold the key to solving the problem in this context. This paper reviews recent advances in parallel frequent pattern mining, analysing them through the Big Data lens. Load balancing and work partitioning are the major challenges to be conquered. These challenges always invoke innovative methods to do, as Big Data evolves with no limits. The biggest challenge than before is conquering unstructured data for finding frequent patterns. To accomplish this Semi Structured Doc-Model and ranking of patterns are used.

Clustering of Time Series Data

2011 ◽  
pp. 172-175
Author(s):  
Anne Denton
Keyword(s):  
Data Mining ◽  
Time Series ◽  
Pattern Mining ◽  
Time Series Data ◽  
Frequent Pattern Mining ◽  
Frequent Pattern ◽  
Series Data ◽  
Science And Engineering ◽  
Data Mining Algorithms ◽  
Mining Algorithms

Time series data is of interest to most science and engineering disciplines and analysis techniques have been developed for hundreds of years. There have, however, in recent years been new developments in data mining techniques, such as frequent pattern mining, which take a different perspective of data. Traditional techniques were not meant for such pattern-oriented approaches. There is, as a result, a significant need for research that extends traditional time-series analysis, in particular clustering, to the requirements of the new data mining algorithms.

Novel Adverse Events of Iloperidone: A Disproportionality Analysis in US Food and Drug Administration Adverse Event Reporting System (FAERS) Database

2019 ◽  
Vol 14 (1) ◽  
pp. 21-26 ◽  
Author(s):  
Viswam Subeesh ◽  
Eswaran Maheswari ◽  
Hemendra Singh ◽  
Thomas Elsa Beulah ◽  
Ann Mary Swaroop
Keyword(s):  
Data Mining ◽  
Adverse Event ◽  
Adverse Events ◽  
Reporting System ◽  
Adverse Event Reporting System ◽  
Adverse Event Reporting ◽  
Disproportionality Analysis ◽  
Positive Signal ◽  
Data Mining Algorithms ◽  
Mining Algorithms

Background: The signal is defined as “reported information on a possible causal relationship between an adverse event and a drug, of which the relationship is unknown or incompletely documented previously”. Objective: To detect novel adverse events of iloperidone by disproportionality analysis in FDA database of Adverse Event Reporting System (FAERS) using Data Mining Algorithms (DMAs). Methodology: The US FAERS database consists of 1028 iloperidone associated Drug Event Combinations (DECs) which were reported from 2010 Q1 to 2016 Q3. We consider DECs for disproportionality analysis only if a minimum of ten reports are present in database for the given adverse event and which were not detected earlier (in clinical trials). Two data mining algorithms, namely, Reporting Odds Ratio (ROR) and Information Component (IC) were applied retrospectively in the aforementioned time period. A value of ROR-1.96SE>1 and IC- 2SD>0 were considered as the threshold for positive signal. Results: The mean age of the patients of iloperidone associated events was found to be 44years [95% CI: 36-51], nevertheless age was not mentioned in twenty-one reports. The data mining algorithms exhibited positive signal for akathisia (ROR-1.96SE=43.15, IC-2SD=2.99), dyskinesia (21.24, 3.06), peripheral oedema (6.67,1.08), priapism (425.7,9.09) and sexual dysfunction (26.6-1.5) upon analysis as those were well above the pre-set threshold. Conclusion: Iloperidone associated five potential signals were generated by data mining in the FDA AERS database. The result requires an integration of further clinical surveillance for the quantification and validation of possible risks for the adverse events reported of iloperidone.

Sign in / Sign up

Export Citation Format

Share Document