IDEAS home Printed from https://ideas.repec.org/a/wly/apsmbi/v25y2009i6p737-768.html

Markovian analysis for automatic new topic identification in search engine transaction logs

Author

Listed:
  • Huseyin C. Ozmutlu

Abstract

Topic analysis of search engine user queries is an important task, since successful exploitation of the topic of queries can result in the design of new information retrieval algorithms for more efficient search engines. Identification of topic changes within a user search session is a key issue in analysis of search engine user queries. This study presents an application of Markov chains in the area of search engine research to automatically identify topic changes in a user session by using statistical characteristics of queries, such as time intervals, query reformulation patterns and the continuation/shift status of the previous query. The findings show that Markov chains provide fairly successful results for automatic new topic identification with a high level of estimation for topic continuations and shifts. Copyright © 2009 John Wiley & Sons, Ltd.

Suggested Citation

  • Huseyin C. Ozmutlu, 2009. "Markovian analysis for automatic new topic identification in search engine transaction logs," Applied Stochastic Models in Business and Industry, John Wiley & Sons, vol. 25(6), pages 737-768, November.
  • Handle: RePEc:wly:apsmbi:v:25:y:2009:i:6:p:737-768
    DOI: 10.1002/asmb.758
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/asmb.758
    Download Restriction: no

    File URL: https://libkey.io/10.1002/asmb.758?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Amanda Spink & H. Cenk Ozmutlu & Seda Ozmutlu, 2002. "Multitasking information seeking and searching processes," Journal of the American Society for Information Science and Technology, Association for Information Science & Technology, vol. 53(8), pages 639-652.
    2. Amanda Spink & Dietmar Wolfram & Major B. J. Jansen & Tefko Saracevic, 2001. "Searching the web: The public and their queries," Journal of the American Society for Information Science and Technology, Association for Information Science & Technology, vol. 52(3), pages 226-234.
    3. Hsiao‐Tieh Pu & Shui‐Lung Chuang & Chyan Yang, 2002. "Subject categorization of query terms for exploring Web users' search interests," Journal of the American Society for Information Science and Technology, Association for Information Science & Technology, vol. 53(8), pages 617-630.
    4. Xiangji Huang & Fuchun Peng & Aijun An & Dale Schuurmans, 2004. "Dynamic Web log session identification with statistical language models," Journal of the American Society for Information Science and Technology, Association for Information Science & Technology, vol. 55(14), pages 1290-1303, December.
    5. Ronald W. Wolff, 1982. "Poisson Arrivals See Time Averages," Operations Research, INFORMS, vol. 30(2), pages 223-231, April.
    6. L. Di Scala & L. La Rocca & G. Consonni, 2004. "A Bayesian Hierarchical Model for the Evaluation of a Website," Journal of Applied Statistics, Taylor & Francis Journals, vol. 31(1), pages 15-27.
    7. Dietmar Wolfram & Amanda Spink & Bernard J. Jansen & Tefko Saracevic, 2001. "Vox populi: The public searching of the web," Journal of the American Society for Information Science and Technology, Association for Information Science & Technology, vol. 52(12), pages 1073-1074.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Raffaella Nori & Massimiliano Palmiero & Fiorella Giusberti & Elisa Gambetti & Laura Piccardi, 2020. "Web searching and navigation: Age, intelligence, and familiarity," Journal of the Association for Information Science & Technology, Association for Information Science & Technology, vol. 71(8), pages 902-915, August.
    2. Tetsuji Hirayama, 2003. "Mean sojourn times in multiclass feedback queues with gated disciplines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(7), pages 719-741, October.
    3. Ortega, José Luis & Aguillo, Isidro, 2010. "Differences between web sessions according to the origin of their visits," Journal of Informetrics, Elsevier, vol. 4(3), pages 331-337.
    4. Yi Bu & Binglu Wang & Win-bin Huang & Shangkun Che & Yong Huang, 2018. "Using the appearance of citations in full text on author co-citation analysis," Scientometrics, Springer;Akadémiai Kiadó, vol. 116(1), pages 275-289, July.
    5. Mohebbi, E., 2008. "A note on a production control model for a facility with limited storage capacity in a random environment," European Journal of Operational Research, Elsevier, vol. 190(2), pages 562-570, October.
    6. Koki Inami & Tuan Phung-Duc, 2025. "Analysis of Dynamic Transaction Fee Blockchain Using Queueing Theory," Mathematics, MDPI, vol. 13(6), pages 1-18, March.
    7. Zsolt Saffer & Sergey Andreev & Yevgeni Koucheryavy, 2016. "$$M/D^{[y]}/1$$ M / D [ y ] / 1 Periodically gated vacation model and its application to IEEE 802.16 network," Annals of Operations Research, Springer, vol. 239(2), pages 497-520, April.
    8. Yeon-Koo Che, 2026. "Dynamic Market Design," Papers 2601.00155, arXiv.org.
    9. Nitin Kumar, 2025. "Analysis of a manufacturing queueing system using bi-level randomized policy," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 33(1), pages 1-28, April.
    10. Ken’ichi Kawanishi & Yuki Ino, 2025. "Upper and Lower Bounds of Performance Metrics in Hybrid Systems with Setup Time," Mathematics, MDPI, vol. 13(16), pages 1-40, August.
    11. Kim, Young Joo & Hwang, Hark, 2009. "Incremental discount policy of cell-phone carrier with connection success rate constraint," European Journal of Operational Research, Elsevier, vol. 196(2), pages 682-687, July.
    12. Josh Reed & Bo Zhang, 2017. "Managing capacity and inventory jointly for multi-server make-to-stock queues," Queueing Systems: Theory and Applications, Springer, vol. 86(1), pages 61-94, June.
    13. Lee, Doo Ho & Kim, Bo Keun, 2015. "A note on the sojourn time distribution of an M/G/1 queue with a single working vacation and vacation interruption," Operations Research Perspectives, Elsevier, vol. 2(C), pages 57-61.
    14. Glynn, Peter & Jacobovic, Royi & Mandjes, Michel, 2025. "Moments of polynomial functionals of spectrally positive Lévy processes," Stochastic Processes and their Applications, Elsevier, vol. 190(C).
    15. Hum, Sin-Hoon & Parlar, Mahmut & Zhou, Yun, 2018. "Measurement and optimization of responsiveness in supply chain networks with queueing structures," European Journal of Operational Research, Elsevier, vol. 264(1), pages 106-118.
    16. Johansen, Søren Glud, 2021. "The Markov model for base-stock control of an inventory system with Poisson demand, non-crossing lead times and lost sales," International Journal of Production Economics, Elsevier, vol. 231(C).
    17. Claudia Diamantini & Paolo Lo Giudice & Domenico Potena & Emanuele Storti & Domenico Ursino, 2021. "An Approach to Extracting Topic-guided Views from the Sources of a Data Lake," Information Systems Frontiers, Springer, vol. 23(1), pages 243-262, February.
    18. Vyacheslav M. Abramov, 2019. "Correction to: Conservative and Semiconservative Random Walks: Recurrence and Transience," Journal of Theoretical Probability, Springer, vol. 32(1), pages 541-543, March.
    19. Sinziana Spiridon, 2010. "Patterns In Query Reformulation In Online Searching Behavior," Analele Stiintifice ale Universitatii "Alexandru Ioan Cuza" din Iasi - Stiinte Economice (1954-2015), Alexandru Ioan Cuza University, Faculty of Economics and Business Administration, vol. 2010, pages 407-416, july.
    20. Noah Gans & Yong-Pin Zhou, 2007. "Call-Routing Schemes for Call-Center Outsourcing," Manufacturing & Service Operations Management, INFORMS, vol. 9(1), pages 33-50, May.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:apsmbi:v:25:y:2009:i:6:p:737-768. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1526-4025 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.