14,888 research outputs found
An Algorithm for Generating Non-Redundant Sequential Rules for Medical Time Series Data
In this paper, an algorithm for generating non-redundant sequential rules for the medical time series data is designed. This study is the continuation of my previous study titled οΏ½An Algorithm for Mining Closed Weighted Sequential Patterns with Flexing Time Interval for Medical Time Series DataοΏ½ [25]. In my previous work, the sequence weight for each sequence was calculated based on the time interval between the itemsets.Subsequently, the candidate sequences were generated with flexible time intervals initially. The next step was, computation of frequent sequential patterns with the aid of proposed support measure. Next the frequent sequential patterns were subjected to closure checking process which leads to filter the closed sequential patterns with flexible time intervals. Finally, the methodology produced with necessary sequential patterns was proved. This methodology constructed closed sequential patterns which was 23.2% lesser than the sequential patterns. In this study, the sequential rules are generated based on the calculation of confidence value of the rule from the closed sequential pattern. Once the closed sequential rules are generated which are subjected to non-redundant checking process, that leads to produce the final set of non-redundant weighted closed sequential rules with flexible time intervals. This study produces non-redundant sequential rules which is 172.37% lesser than sequential rules
MINING TOP-K FREQUENT SEQUENTIAL PATTERN IN ITEM INTERVAL EXTENDED SEQUENCE DATABASE
Abstract. Frequent sequential pattern mining in item interval extended sequence database (iSDB) has been one of interesting task in recent years. Unlike classic frequent sequential pattern mining, the pattern mining in iSDB also consider the item interval between successive items; thus, it may extract more meaningful sequential patterns in real life. Most previous frequent sequential pattern mining in iSDB algorithms needs a minimum support threshold (minsup) to perform the mining. However, itβs not easy for users to provide an appropriate threshold in practice. The too high minsup value will lead to missing valuable patterns, while the too low minsup value may generate too many useless patterns. To address this problem, we propose an algorithm: TopKWFP β Top-k weighted frequent sequential pattern mining in item interval extended sequence database. Our algorithm doesnβt need to provide a fixed minsup value, this minsup value will dynamically raise during the mining proces
Mining Traversal Patterns from Weighted Traversals and Graph
μ€μΈκ³μ λ§μ λ¬Έμ λ€μ κ·Έλνμ κ·Έ κ·Έλνλ₯Ό μννλ νΈλμμ
μΌλ‘ λͺ¨λΈλ§λ μ μλ€. μλ₯Ό λ€λ©΄, μΉ νμ΄μ§μ μ°κ²°κ΅¬μ‘°λ κ·Έλνλ‘ ννλ μ μκ³ , μ¬μ©μμ μΉ νμ΄μ§ λ°©λ¬Έκ²½λ‘λ κ·Έ κ·Έλνλ₯Ό μννλ νΈλμμ
μΌλ‘ λͺ¨λΈλ§λ μ μλ€. μ΄μ κ°μ΄ κ·Έλνλ₯Ό μννλ νΈλμμ
μΌλ‘λΆν° μ€μνκ³ κ°μΉ μλ ν¨ν΄μ μ°Ύμλ΄λ κ²μ μλ―Έ μλ μΌμ΄λ€. μ΄λ¬ν ν¨ν΄μ μ°ΎκΈ° μν μ§κΈκΉμ§μ μ°κ΅¬μμλ μνλ κ·Έλνμ κ°μ€μΉλ₯Ό κ³ λ €νμ§ μκ³ λ¨μν λΉλ°νλ ν¨ν΄λ§μ μ°Ύλ μκ³ λ¦¬μ¦μ μ μνμλ€. μ΄λ¬ν μκ³ λ¦¬μ¦μ νκ³λ λ³΄λ€ μ λ’°μ± μκ³ μ νν ν¨ν΄μ νμ¬νλ λ° μ΄λ €μμ΄ μλ€λ κ²μ΄λ€.
λ³Έ λ
Όλ¬Έμμλ μνλ κ·Έλνμ μ μ μ λΆμ¬λ κ°μ€μΉλ₯Ό κ³ λ €νμ¬ ν¨ν΄μ νμ¬νλ λ κ°μ§ λ°©λ²λ€μ μ μνλ€. 첫 λ²μ§Έ λ°©λ²μ κ·Έλνλ₯Ό μννλ μ 보μ κ°μ€μΉκ° μ‘΄μ¬νλ κ²½μ°μ λΉλ° μν ν¨ν΄μ νμ¬νλ κ²μ΄λ€. κ·Έλν μνμ λΆμ¬λ μ μλ κ°μ€μΉλ‘λ λ λμκ°μ μ΄λ μκ°μ΄λ μΉ μ¬μ΄νΈλ₯Ό λ°©λ¬Έν λ ν νμ΄μ§μμ λ€λ₯Έ νμ΄μ§λ‘ μ΄λνλ μκ° λ±μ΄ λ μ μλ€. λ³Έ λ
Όλ¬Έμμλ μ’ λ μ νν μν ν¨ν΄μ λ§μ΄λνκΈ° μν΄ ν΅κ³νμ μ λ’° ꡬκ°μ μ΄μ©νλ€. μ¦, μ 체 μνμ κ° κ°μ μ λΆμ¬λ κ°μ€μΉλ‘λΆν° μ λ’° ꡬκ°μ ꡬν ν μ λ’° ꡬκ°μ λ΄μ μλ μνλ§μ μ ν¨ν κ²μΌλ‘ μΈμ νλ λ°©λ²μ΄λ€. μ΄λ¬ν λ°©λ²μ μ μ©ν¨μΌλ‘μ¨ λμ± μ λ’°μ± μλ μν ν¨ν΄μ λ§μ΄λν μ μλ€. λν μ΄λ κ² κ΅¬ν ν¨ν΄κ³Ό κ·Έλν μ 보λ₯Ό μ΄μ©νμ¬ ν¨ν΄ κ°μ μ°μ μμλ₯Ό κ²°μ ν μ μλ λ°©λ²κ³Ό μ±λ₯ ν₯μμ μν μκ³ λ¦¬μ¦λ μ μνλ€.
λ λ²μ§Έ λ°©λ²μ κ·Έλνμ μ μ μ κ°μ€μΉκ° λΆμ¬λ κ²½μ°μ κ°μ€μΉκ° κ³ λ €λ λΉλ° μν ν¨ν΄μ νμ¬νλ λ°©λ²μ΄λ€. κ·Έλνμ μ μ μ λΆμ¬λ μ μλ κ°μ€μΉλ‘λ μΉ μ¬μ΄νΈ λ΄μ κ° λ¬Έμμ μ 보λμ΄λ μ€μλ λ±μ΄ λ μ μλ€. μ΄ λ¬Έμ μμλ λΉλ° μν ν¨ν΄μ κ²°μ νκΈ° μνμ¬ ν¨ν΄μ λ°μ λΉλλΏλ§ μλλΌ λ°©λ¬Έν μ μ μ κ°μ€μΉλ₯Ό λμμ κ³ λ €νμ¬μΌ νλ€. μ΄λ₯Ό μν΄ λ³Έ λ
Όλ¬Έμμλ μ μ μ κ°μ€μΉλ₯Ό μ΄μ©νμ¬ ν₯νμ λΉλ° ν¨ν΄μ΄ λ κ°λ₯μ±μ΄ μλ ν보 ν¨ν΄μ κ° λ§μ΄λ λ¨κ³μμ μ κ±°νμ§ μκ³ μ μ§νλ μκ³ λ¦¬μ¦μ μ μνλ€. λν μ±λ₯ ν₯μμ μν΄ ν보 ν¨ν΄μ μλ₯Ό κ°μμν€λ μκ³ λ¦¬μ¦λ μ μνλ€.
λ³Έ λ
Όλ¬Έμμ μ μν λ κ°μ§ λ°©λ²μ λνμ¬ λ€μν μ€νμ ν΅νμ¬ μν μκ° λ° μμ±λλ ν¨ν΄μ μ λ±μ λΉκ΅ λΆμνμλ€.
λ³Έ λ
Όλ¬Έμμλ μνμ κ°μ€μΉκ° μλ κ²½μ°μ κ·Έλνμ μ μ μ κ°μ€μΉκ° μλ κ²½μ°μ λΉλ° μν ν¨ν΄μ νμ¬νλ μλ‘μ΄ λ°©λ²λ€μ μ μνμλ€. μ μν λ°©λ²λ€μ μΉ λ§μ΄λκ³Ό κ°μ λΆμΌμ μ μ©ν¨μΌλ‘μ¨ μΉ κ΅¬μ‘°μ ν¨μ¨μ μΈ λ³κ²½μ΄λ μΉ λ¬Έμμ μ κ·Ό μλ ν₯μ, μ¬μ©μλ³ κ°μΈνλ μΉ λ¬Έμ κ΅¬μΆ λ±μ΄ κ°λ₯ν κ²μ΄λ€.Abstract β
Ά
Chapter 1 Introduction
1.1 Overview
1.2 Motivations
1.3 Approach
1.4 Organization of Thesis
Chapter 2 Related Works
2.1 Itemset Mining
2.2 Weighted Itemset Mining
2.3 Traversal Mining
2.4 Graph Traversal Mining
Chapter 3 Mining Patterns from Weighted Traversals on
Unweighted Graph
3.1 Definitions and Problem Statements
3.2 Mining Frequent Patterns
3.2.1 Augmentation of Base Graph
3.2.2 In-Mining Algorithm
3.2.3 Pre-Mining Algorithm
3.2.4 Priority of Patterns
3.3 Experimental Results
Chapter 4 Mining Patterns from Unweighted Traversals on
Weighted Graph
4.1 Definitions and Problem Statements
4.2 Mining Weighted Frequent Patterns
4.2.1 Pruning by Support Bounds
4.2.2 Candidate Generation
4.2.3 Mining Algorithm
4.3 Estimation of Support Bounds
4.3.1 Estimation by All Vertices
4.3.2 Estimation by Reachable Vertices
4.4 Experimental Results
Chapter 5 Conclusions and Further Works
Reference
Hierarchies of Weighted Closed Partially-Ordered Patterns for Enhancing Sequential Data Analysis
International audienceDiscovering sequential patterns in sequence databases is an important data mining task. Recently, hierarchies of closed partially-ordered patterns (cpo-patterns), built directly using Relational Concept Analysis (RCA), have been proposed to simplify the interpretation step by highlighting how cpo-patterns relate to each other. However, there are practical cases (e.g. choosing interesting navigation paths in the obtained hierarchies) when these hierarchies are still insufficient for the expert. To address these cases, we propose to extract hierarchies of more informative cpo-patterns, namely weighted cpo-patterns (wcpo-patterns), by extending the RCA-based approach. These wcpo-patterns capture and explicitly show not only the order on itemsets but also their different influence on the analysed sequences. We illustrate how the proposed wcpo-patterns can enhance sequential data analysis on a toy example
Feature-based time-series analysis
This work presents an introduction to feature-based time-series analysis. The
time series as a data type is first described, along with an overview of the
interdisciplinary time-series analysis literature. I then summarize the range
of feature-based representations for time series that have been developed to
aid interpretable insights into time-series structure. Particular emphasis is
given to emerging research that facilitates wide comparison of feature-based
representations that allow us to understand the properties of a time-series
dataset that make it suited to a particular feature-based representation or
analysis algorithm. The future of time-series analysis is likely to embrace
approaches that exploit machine learning methods to partially automate human
learning to aid understanding of the complex dynamical patterns in the time
series we measure from the world.Comment: 28 pages, 9 figure
Sequential Pattern Mining with Multidimensional Interval Items
In real sequence pattern mining scenarios, the interval information between two item sets is very important. However, although existing algorithms can effectively mine frequent subsequence sets, the interval information is ignored. This paper aims to mine sequential patterns with multidimensional interval items in sequence databases. In order to address this problem, this paper defines and specifies the interval event problem in the sequential pattern mining task. Then, the interval event items framework is proposed to handle the multidimensional interval event items. Moreover, the MII-Prefixspan algorithm is introduced for the sequential pattern with multidimensional interval event items mining tasks. This algorithm adds the processing of interval event items in the mining process. We can get richer and more in line with actual needs information from mined sequence patterns through these methods. This scheme is applied to the actual website behaviour analysis task to obtain more valuable information for web optimization and provide more valuable sequence pattern information for practical problems. This work also opens a new pathway toward more efficient sequential pattern mining tasks
- β¦