Mining hybrid sequential patterns and sequential rules
Information SystemsPublished 1 July 2002
Yen‐Liang Chen, Shih-Sheng Chen, Ping‐Yu Hsu
Citations44
SJR quartileQ1
SJR score0.89
SNIP1.96
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
Two algorithms are developed to mine hybrid patterns, where the first algorithm is easy but slow while the second complicated but much faster than the first one.
Abstract
The problem addressed in this paper is to discover the frequently occurred sequential patterns from databases. Basically, the existing studies on finding sequential patterns can be roughly classified into two main categories. In the
Keywords
Computer Science
Mining association rules between sets of items in large databases
14,720 Citations1993Rakesh Agrawal, Tomasz Imieliński +1 more
An efficient algorithm is presented that generates all significant association rules between items in the database of customer transactions and incorporates buffer management and novel estimation and pruning techniques.
Fast algorithms for mining association rules
10,739 Citations1998Rakesh Agrawal, Ramakrishnan Srikant
ACM SIGMOD RecordMining frequent patterns without candidate generation
6,360 Citations2000Jiawei Han, Jian Pei +1 more
Mining sequential patterns
5,115 Citations2002R. K. Agrawal, Ramakrishnan Srikant
Three algorithms are presented to solve the problem of mining sequential patterns over databases of customer transactions, and empirically evaluating their performance using synthetic data shows that two of them have comparable performance.
Mining frequent patterns without candidate generation
3,195 Citations2000Jiawei Han, Jian Pei +1 more
This study proposes a novel frequent pattern tree (FP-tree) structure, which is an extended prefix-tree structure for storing compressed, crucial information about frequent patterns, and develops an efficient FP-tree-based mining method, FP-growth, for mining the complete set of frequent patterns by pattern fragment growth.
IEEE Transactions on Knowledge and Data EngineeringData mining: an overview from a database perspective
2,221 Citations1996Ming-Syan Chen⋆, Jiawei Han +1 more
This article provides a survey, from a database researcher's point of view, on the data mining techniques developed recently, a classification of the available data mining Techniques, and a comparative study of such techniques is presented.
Lecture notes in computer scienceEfficient similarity search in sequence databases
1,972 Citations1993Rakesh Agrawal, Christos Faloutsos +1 more
An indexing method for time sequences for processing similarity queries using R * -trees to index the sequences and efficiently answer similarity queries and provides experimental results which show that the method is superior to search based on sequential scanning.
PrefixSpan,: mining sequential patterns efficiently by prefix-projected pattern growth
1,791 Citations2005Jian Pei, Jiawei Han +5 more
This work proposes a novel sequential pattern mining method, called Prefixspan (i.e., Prefix-projected - Ettern_ mining), which explores prejxprojection in sequential pattern Mining, and shows that Pre fixspan outperforms both the Apriori-based GSP algorithm and another recently proposed method; Frees pan, in mining large sequence data bases.
Fast subsequence matching in time-series databases
1,720 Citations1994Christos Faloutsos, M. Ranganathan +1 more
Future Generation Computer SystemsMining generalized association rules
1,617 Citations1997Ramakrishnan Srikant, Rakesh Agrawal
A new interest-measure for rules which uses the information in the taxonomy is presented, and given a user-specified “minimum-interest-level”, this measure prunes a large number of redundant rules.
Knowledge and Information SystemsData Preparation for Mining World Wide Web Browsing Patterns
1,464 Citations1999Robert Cooley, Bamshad Mobasher +1 more
This paper presents several data preparation techniques in order to identify unique users and user sessions and Transactions identified by the proposed methods are used to discover association rules from real world data using the WEBMINER system.
Data Mining and Knowledge DiscoveryDiscovery of Frequent Episodes in Event Sequences
1,445 Citations1997Heikki Mannila, Hannu Toivonen +1 more
This work gives efficient algorithms for the discovery of all frequent episodes from a given class of episodes, and presents detailed experimental results that are in use in telecommunication alarm management.
An effective hash-based algorithm for mining association rules
1,412 Citations1995Jong Soo Park, Ming-Syan Chen⋆ +1 more
The number of candidate 2-itemsets generated by the proposed algorithm is, in orders of magnitude, smaller than that by previous methods, thus resolving the performance bottleneck, and allows us to effectively trim the transaction database size at a much earlier stage of the iterations, thereby reducing the computational cost for later iterations significantly.
IEEE Transactions on Knowledge and Data EngineeringParallel mining of association rules
1,069 Citations1996R. K. Agrawal, J.C. Shafer
This work considers the problem of mining association rules on a shared nothing multiprocessor and presents three algorithms that explore a spectrum of trade-offs between computation, communication, memory usage, synchronization, and the use of problem specific information.
Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases
655 Citations1995Rakesh Agrawal, King-Ip Lin +2 more
A new model of similarity of time sequences is introduced that captures the intuitive notion that two sequences should be considered similar if they have enough non-overlapping time-ordered pairs of subsequences thar are similar.
Efficient mining of partial periodic patterns in time series database
581 Citations1999Jiawei Han, Guozhu Dong +1 more
This work presents several algorithms for efficient mining of partial periodic patterns by exploring some interesting properties related to partial periodicity such as the Apriori property and the max-subpattern hit set property, and by shared mining of multiple periods.
IEEE Transactions on Knowledge and Data EngineeringEfficient data mining for path traversal patterns
540 Citations1998Ming-Syan Chen⋆, Jong Soo Park +1 more
The authors explore a new data mining capability that involves mining path traversal patterns in a distributed information-providing environment where documents or objects are linked together to facilitate interactive access and show that the option of selective scan is very advantageous and can lead to prominent performance improvement.
Lecture notes in computer scienceMining Access Patterns Efficiently from Web Logs
498 Citations2000Jian Pei, Jiawei Han +2 more
A novel data structure, called Web access pattern tree, or WAP-tree in short, is developed for efficient mining of access patterns from pieces of logs for access pattern mining.
IEEE Intelligent Systems and their ApplicationsGraph-based data mining
411 Citations2000Diane J. Cook, Lawrence B. Holder
Using databases represented as graphs, the Subdue system performs two key data mining techniques: unsupervised pattern discovery and supervised concept learning from examples.
Cyclic association rules
404 Citations2002B. Ozden, Sridhar Ramaswamy +1 more
This work devise a new technique called cycle pruning, which reduces the amount of time needed to find cyclic association rules by studying the interaction between association rules and time, and presents two new algorithms for discovering such rules.
IEEE Transactions on Knowledge and Data EngineeringMining multiple-level association rules in large databases
330 Citations1999Jiawei Han, Yongjian Fu
The study shows that efficient algorithms can be developed from large databases for the discovery of interesting and strong multiple-level association rules from large transaction databases.
Efficient enumeration of frequent sequences
203 Citations1998Mohammed J. Zaki
SPADE utilizes combinatorial properties to decompose the original problem into smaller sub-problems, that can be independently solved in main-memory using efficient lattice search techniques, and using simple join operations.
Combinatorial pattern discovery for scientific data
149 Citations1994Jason Tsong-Li Wang, Gung‐Wei Chirn +4 more
This paper presents an example of combinatorial pattern discovery: the discovery of patterns in protein databases, which give information that is complementary to the best protein classifier available today.
HierarchyScan: a hierarchical similarity search algorithm for databases of long sequences
81 Citations2002Chung‐Sheng Li, Philip S. Yu +1 more
PLANMINE: sequence mining for plan failures
60 Citations1998Mohammed J. Zaki, Neal Lesh +1 more
The PLANMINE sequence mining algorithm to extract patterns of events that predict failures in databases of plan executions is presented, and the rules discovered are evaluated to show that they are extremely useful for understanding and improving plans, as well as for building monitors that raise alarms before failures happen.
Lecture notes in computer scienceAnalysis and Visualization of Metrics for Online Merchandising
37 Citations2000Juhnyoung Lee, Mark Podlaseck +3 more
A new set of metrics for Web merchandising, which are called micro-conversion rates, are defined, which provide capabilities for examining data about sales and merchandise in online stores, and also provide detailed insight into the effectiveness of different Web Merchandising efforts by answering related business questions.
Decision Support SystemsMining relational patterns from multiple relational tables
37 Citations1999Maytal Saar Tsechansky, Nava Pliskin +2 more
This paper presents the concept of relational patterns and their approach to extract them from multiple relational tables, and describes the experiences from a test-bed implementation of this approach on a real hospital's discharge abstract database.