Skip to main content

Nested State-Transition Graph Model of User Behaviors

  • Conference paper
  • 1262 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2690))

Abstract

This paper proposes a systematic data mining approach to study users’ Internet resource access actions for finding out behavior models as state-transition graphs. A series of Internet resource access actions are stored in a database of [user, resource-access-action, time] records. Such access actions are treated as basic behavior elements and form an action hierarchy which possesses different levels of radix codes. For every user, the data sequence is divided into a series of transactions and all the actions in a transaction constitute a special behavior pattern, called (inter-transaction) behavior. The behavior codes can be aggregated as behavior hierarchy also. Accordingly, each user can possess his/her own behavior model, formulated as a state-transition graph with behavior states and transition probability between behaviors. The overall mining process is computerized and validated by experiment. The example uses simulated sequential data to show how to combine AprioriAll algorithm and the proposed algorithm to construct a set of nested state-transition graphs.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Srikant, R., Agrawal, R.: Mining sequential patterns: Generalizations and performance improvements. In: Apers, P.M.G., Bouzeghoub, M., Gardarin, G. (eds.) EDBT 1996. LNCS, vol. 1057, pp. 3–17. Springer, Heidelberg (1996)

    Google Scholar 

  2. Zaki, M.J.: Efficient enumeration of frequent sequences. In: Proc. Of the ACM CIKM Conference, pp. 68–75 (1998)

    Google Scholar 

  3. Tung, A.K.H., Lu, H., Han, J., Feng, L.: Breaking the barrier of trans-actions: Mining inter-transaction association rules. In: Proc. KDD 1999, pp. 297–301. ACM, New York (1999)

    Chapter  Google Scholar 

  4. Halbwachs, N.: Synchronous Programming of reactive systems. Kluwer, Dordrecht (1993)

    MATH  Google Scholar 

  5. Agrawal, R., Srikant, R.: Mining sequential patterns. In: Proc. of the IEEE International Coference on Data Engineering, pp. 3–14 (1995)

    Google Scholar 

  6. Rabiner, L.R., Juang, B.H.: An introduction to hidden Markov models. IEEE ASSP Magazine, 4–17 (1986)

    Google Scholar 

  7. Mannila, H., Toivonen, H., Verkamo, A.I.: Discovering frequent episodes in sequences. In: Proc. of the KDD conference, pp. 210–215 (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Heh, JS., Cheng, SY., Ma, NC. (2003). Nested State-Transition Graph Model of User Behaviors. In: Liu, J., Cheung, Ym., Yin, H. (eds) Intelligent Data Engineering and Automated Learning. IDEAL 2003. Lecture Notes in Computer Science, vol 2690. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45080-1_105

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45080-1_105

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40550-4

  • Online ISBN: 978-3-540-45080-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics