English  |  正體中文  |  简体中文  |  Items with full text/Total items : 52635/87802 (60%)
Visitors : 9389613      Online Users : 53
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/78604

    Title: Using Petri Nets to Model the Web Structure
    Authors: Yang, Shih-yang;Chen, Po-zung;Sun, Chu-hao
    Contributors: 淡江大學資訊工程學系
    Date: 2007-05
    Issue Date: 2012-10-17 11:26:33 (UTC+8)
    Abstract: Precise analysis of the web structure can facilitate data processing and enhance the accuracy of the mining results in the procedure of web usage mining. Many researchers have identified that pageview identification and path completion are of great importance in the result of web usage mining. Currently, there is still a lack of an effective and systematic method to analyze and deal with the two steps. In the present study, we propose the application of Petri Nets (PN), a model used to analyze the framework of webpages in a website. We adopt Place in the PN model to represent webpage on the websites and use Transition to represent hyperlink The study explores how to undergo the pageview identification after we use the PN model to conduct the analysis of the framework and then obtain incident matrix. Likewise, we use reachability property in the model to undergo path completion.
    Relation: The 4th International Symposium on Applied Computational Intelligence and Informatics (SACI '07), pp.231-235
    DOI: 10.1109/SACI.2007.375516
    Appears in Collections:[資訊工程學系暨研究所] 會議論文

    Files in This Item:

    File Description SizeFormat
    Using Petri Nets to Model the Web Structure.pdf1481KbAdobe PDF161View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback