Access Restriction

Author Masseglia, F. ♦ Cathala, F. ♦ Poncelet, P.
Source CiteSeerX
Content type Text
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Marketbasket Problem ♦ Typical Application Gr ♦ Knowledge Discovery ♦ Data Mining ♦ Mining Sequential Pattern ♦ Association Rule ♦ Past Year ♦ Sequential Pattern ♦ Retail Store ♦ Different Intermediary Data Structure ♦ Gsp Approach ♦ Psp Approach ♦ Time Constraint ♦ General Principle ♦ Purchase Transaction Data ♦ Takled Issue ♦ Great Deal ♦ Decision Support Problem
Description . In this paper, we present an approach, called PSP, for mining sequential patterns embedded in a database. Close to the problem of discovering association rules, mining sequential patterns requires handling time constraints. Originally introduced in [3], the issue is addressed by the GSP approach [10]. Our proposal resumes the general principles of GSP but it makes use of a different intermediary data structure which is proved to be more efficient than in GSP. 1 Introduction Motivated by decision support problems, data mining, also known as knowledge discovery in databases, has been extensively addressed in the few past years (e.g. [5]). Among takled issues, the problem of mining association rules, initially introduced in [1], has recently received a great deal of attention [1, 2, 4, 5, 9, 11]. The problem of mining association rules is often referred to as the "marketbasket " problem, because purchase transaction data collected by retail stores offers a typical application gr...
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Learning Resource Type Article
Publisher Date 1998-01-01