Mining Time-Interval Sequential Patterns with High Utility from Transaction Databases
| Autor: | Anna Y.Q. Huang, Wen-Yen Wang |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Computer science
02 engineering and technology computer.software_genre Human-Computer Interaction Artificial Intelligence 020204 information systems 0202 electrical engineering electronic engineering information engineering Interval (graph theory) 020201 artificial intelligence & image processing Computer Vision and Pattern Recognition Data mining Sequential Pattern Mining Database transaction computer |
| Zdroj: | Journal of Advanced Computational Intelligence and Intelligent Informatics. 20:1018-1026 |
| ISSN: | 1883-8014 1343-0130 |
| DOI: | 10.20965/jaciii.2016.p1018 |
| Popis: | The purpose of time-interval sequential pattern mining is to help superstore business managers promote product sales. Sequential pattern mining discovers the time interval patterns for items: for example, if most customers purchase product item A, and then buy items B and C after r to s and t to u days respectively, the time interval between r to s and t to u days can be provided to business managers to facilitate informed marketing decisions. We treat these time intervals as patterns to be mined, to predict the purchasing time intervals between A and B, as well as B and C. Nevertheless, little work considers the significance of product items while mining these time-interval sequential patterns. This work extends previous work and retains high-utility time interval patterns during pattern mining. This type of mining is meant to more closely reflect actual business practice. Experimental results show the differences between three mining approaches when jointly considering item utility and time intervals for purchased items. In addition to yielding more accurate patterns than the other two methods, the proposed UTMining_A method shortens execution times by delaying join processing and removing unnecessary records. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|