Abstract
The traditional algorithm used for recognizing user browsing patterns has a fixed threshold, causing the number of the large sequence to be the opposite of the increase of sequence length. To solve this problem, an improved algorithm, IAx algorithm is given based on the traditional association rule algorithm. The new algorithm causes the long sequence with smaller support counts to reach the threshold. Consequently, more meaningful sequence patterns can be identified and theoretically proves the validity of the new algorithm as well.
Original language | English |
---|---|
Pages (from-to) | 1570-1572+1602 |
Journal | Harbin Gongye Daxue Xuebao/Journal of Harbin Institute of Technology |
Volume | 37 |
Issue number | 11 |
Publication status | Published - Nov 2005 |
Externally published | Yes |
Keywords
- IA algorithm
- Recognition of sequence patterns
- Threshold
- Web log mining