A graph-based optimization algorithm for website topology using interesting association rules
The Web serves as a global information service center that contains vast amount of data. The Website structure should be designed effectively so that users can efficiently find their information. The main contribution of this paper is to propose a graph-based optimization algorithm to modify Website...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 190 |
|---|---|
| container_issue | |
| container_start_page | 178 |
| container_title | |
| container_volume | 2637 |
| creator | Wu, Edmond H. Ng, Michael K. |
| description | The Web serves as a global information service center that contains vast amount of data. The Website structure should be designed effectively so that users can efficiently find their information. The main contribution of this paper is to propose a graph-based optimization algorithm to modify Website topology using interesting association rules. The interestingness of an association rule A ⇒ B is defined based on the probability measure between two sets of Web pages A and B in the Website. If the probability measure between A and B is low (high), then the association rule A ⇒ B has high (low) interest. The hyperlinks in the Website can be modified to adapt user access patterns according to association rules with high interest. We present experimental results and demonstrate that our method is effective. |
| doi_str_mv | 10.5555/1760894.1760919 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>proquest_acm_b</sourceid><recordid>TN_cdi_acm_books_10_5555_1760894_1760919</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>EBC3072832_24_196</sourcerecordid><originalsourceid>FETCH-LOGICAL-a231t-5ed214c322c19be5bc2787472bbbb63c531a90ef8a9364416686a383c96cb2213</originalsourceid><addsrcrecordid>eNqNkc1rGzEQxdVPYlKfe91LoZd1JY0-jyG0TSCQS3osYlbR2mrXq60kE9K_vjI2PeddZmB-b5jhEfKR0Y1s-sK0osaKzbFaZl-RtdUGpKCgmJbqNVkxxVgPIOyb_zMqGi3fkhUFynurBbwnF9IoYYzRF2Rdyi_aBJxay1bk51W3zbjs-gFLeOzSUuM-_sUa09zhtE051t2-G1PunsJQYg1dTUua0va5O5Q4b7s415BDqcceS0k-nsz5MIXygbwbcSphfa6X5Me3rw_XN_3d_ffb66u7Hjmw2svwyJnwwLlndghy8FwbLTQfmhR4CQwtDaNBC0oIppRRCAa8VX7gnMEl-XTau2DxOI0ZZx-LW3LcY352TFLJQUDj4Mzl9OfQrnZhSOm3D3PNOPkdLu2Z4oBqboA7Lhyzqrk-n1zo9-7IF8eoO0bkzhG5c0QN3bwQdUOOYYR_vGaJ1g</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype><pqid>EBC3072832_24_196</pqid></control><display><type>conference_proceeding</type><title>A graph-based optimization algorithm for website topology using interesting association rules</title><source>Springer Books</source><creator>Wu, Edmond H. ; Ng, Michael K.</creator><contributor>Srivastava, Jaideep ; Jeon, Jongwoo ; Shim, Kyuseok ; Wang, Kyu-Young ; Jeon, Jongwoo ; Whang, Kyu-Young ; Shim, Kyuseok ; Srivatava, Jaideep</contributor><creatorcontrib>Wu, Edmond H. ; Ng, Michael K. ; Srivastava, Jaideep ; Jeon, Jongwoo ; Shim, Kyuseok ; Wang, Kyu-Young ; Jeon, Jongwoo ; Whang, Kyu-Young ; Shim, Kyuseok ; Srivatava, Jaideep</creatorcontrib><description>The Web serves as a global information service center that contains vast amount of data. The Website structure should be designed effectively so that users can efficiently find their information. The main contribution of this paper is to propose a graph-based optimization algorithm to modify Website topology using interesting association rules. The interestingness of an association rule A ⇒ B is defined based on the probability measure between two sets of Web pages A and B in the Website. If the probability measure between A and B is low (high), then the association rule A ⇒ B has high (low) interest. The hyperlinks in the Website can be modified to adapt user access patterns according to association rules with high interest. We present experimental results and demonstrate that our method is effective.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540047605</identifier><identifier>ISBN: 3540047603</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540361756</identifier><identifier>EISBN: 3540361758</identifier><identifier>DOI: 10.5555/1760894.1760919</identifier><identifier>OCLC: 58648887</identifier><identifier>LCCallNum: QA76.9.D35</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer-Verlag</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Data processing. List processing. Character string processing ; Exact sciences and technology ; Information systems. Data bases ; Memory organisation. Data processing ; Software</subject><ispartof>Advances in Knowledge Discovery and Data Mining, 2003, Vol.2637, p.178-190</ispartof><rights>2003 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttps://ebookcentral.proquest.com/covers/3072832-l.jpg</thumbnail><link.rule.ids>309,310,776,777,781,786,787,790,27906</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=15052343$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Srivastava, Jaideep</contributor><contributor>Jeon, Jongwoo</contributor><contributor>Shim, Kyuseok</contributor><contributor>Wang, Kyu-Young</contributor><contributor>Jeon, Jongwoo</contributor><contributor>Whang, Kyu-Young</contributor><contributor>Shim, Kyuseok</contributor><contributor>Srivatava, Jaideep</contributor><creatorcontrib>Wu, Edmond H.</creatorcontrib><creatorcontrib>Ng, Michael K.</creatorcontrib><title>A graph-based optimization algorithm for website topology using interesting association rules</title><title>Advances in Knowledge Discovery and Data Mining</title><description>The Web serves as a global information service center that contains vast amount of data. The Website structure should be designed effectively so that users can efficiently find their information. The main contribution of this paper is to propose a graph-based optimization algorithm to modify Website topology using interesting association rules. The interestingness of an association rule A ⇒ B is defined based on the probability measure between two sets of Web pages A and B in the Website. If the probability measure between A and B is low (high), then the association rule A ⇒ B has high (low) interest. The hyperlinks in the Website can be modified to adapt user access patterns according to association rules with high interest. We present experimental results and demonstrate that our method is effective.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Data processing. List processing. Character string processing</subject><subject>Exact sciences and technology</subject><subject>Information systems. Data bases</subject><subject>Memory organisation. Data processing</subject><subject>Software</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540047605</isbn><isbn>3540047603</isbn><isbn>9783540361756</isbn><isbn>3540361758</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2003</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNqNkc1rGzEQxdVPYlKfe91LoZd1JY0-jyG0TSCQS3osYlbR2mrXq60kE9K_vjI2PeddZmB-b5jhEfKR0Y1s-sK0osaKzbFaZl-RtdUGpKCgmJbqNVkxxVgPIOyb_zMqGi3fkhUFynurBbwnF9IoYYzRF2Rdyi_aBJxay1bk51W3zbjs-gFLeOzSUuM-_sUa09zhtE051t2-G1PunsJQYg1dTUua0va5O5Q4b7s415BDqcceS0k-nsz5MIXygbwbcSphfa6X5Me3rw_XN_3d_ffb66u7Hjmw2svwyJnwwLlndghy8FwbLTQfmhR4CQwtDaNBC0oIppRRCAa8VX7gnMEl-XTau2DxOI0ZZx-LW3LcY352TFLJQUDj4Mzl9OfQrnZhSOm3D3PNOPkdLu2Z4oBqboA7Lhyzqrk-n1zo9-7IF8eoO0bkzhG5c0QN3bwQdUOOYYR_vGaJ1g</recordid><startdate>20030101</startdate><enddate>20030101</enddate><creator>Wu, Edmond H.</creator><creator>Ng, Michael K.</creator><general>Springer-Verlag</general><general>Springer Berlin / Heidelberg</general><general>Springer</general><scope>FFUUA</scope><scope>IQODW</scope></search><sort><creationdate>20030101</creationdate><title>A graph-based optimization algorithm for website topology using interesting association rules</title><author>Wu, Edmond H. ; Ng, Michael K.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a231t-5ed214c322c19be5bc2787472bbbb63c531a90ef8a9364416686a383c96cb2213</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2003</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Data processing. List processing. Character string processing</topic><topic>Exact sciences and technology</topic><topic>Information systems. Data bases</topic><topic>Memory organisation. Data processing</topic><topic>Software</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Wu, Edmond H.</creatorcontrib><creatorcontrib>Ng, Michael K.</creatorcontrib><collection>ProQuest Ebook Central - Book Chapters - Demo use only</collection><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Wu, Edmond H.</au><au>Ng, Michael K.</au><au>Srivastava, Jaideep</au><au>Jeon, Jongwoo</au><au>Shim, Kyuseok</au><au>Wang, Kyu-Young</au><au>Jeon, Jongwoo</au><au>Whang, Kyu-Young</au><au>Shim, Kyuseok</au><au>Srivatava, Jaideep</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A graph-based optimization algorithm for website topology using interesting association rules</atitle><btitle>Advances in Knowledge Discovery and Data Mining</btitle><date>2003-01-01</date><risdate>2003</risdate><volume>2637</volume><spage>178</spage><epage>190</epage><pages>178-190</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540047605</isbn><isbn>3540047603</isbn><eisbn>9783540361756</eisbn><eisbn>3540361758</eisbn><abstract>The Web serves as a global information service center that contains vast amount of data. The Website structure should be designed effectively so that users can efficiently find their information. The main contribution of this paper is to propose a graph-based optimization algorithm to modify Website topology using interesting association rules. The interestingness of an association rule A ⇒ B is defined based on the probability measure between two sets of Web pages A and B in the Website. If the probability measure between A and B is low (high), then the association rule A ⇒ B has high (low) interest. The hyperlinks in the Website can be modified to adapt user access patterns according to association rules with high interest. We present experimental results and demonstrate that our method is effective.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer-Verlag</pub><doi>10.5555/1760894.1760919</doi><oclcid>58648887</oclcid><tpages>13</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Advances in Knowledge Discovery and Data Mining, 2003, Vol.2637, p.178-190 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_acm_books_10_5555_1760894_1760919 |
| source | Springer Books |
| subjects | Applied sciences Computer science control theory systems Data processing. List processing. Character string processing Exact sciences and technology Information systems. Data bases Memory organisation. Data processing Software |
| title | A graph-based optimization algorithm for website topology using interesting association rules |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-20T12%3A11%3A27IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_acm_b&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=A%20graph-based%20optimization%20algorithm%20for%20website%20topology%20using%20interesting%20association%20rules&rft.btitle=Advances%20in%20Knowledge%20Discovery%20and%20Data%20Mining&rft.au=Wu,%20Edmond%20H.&rft.date=2003-01-01&rft.volume=2637&rft.spage=178&rft.epage=190&rft.pages=178-190&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540047605&rft.isbn_list=3540047603&rft_id=info:doi/10.5555/1760894.1760919&rft_dat=%3Cproquest_acm_b%3EEBC3072832_24_196%3C/proquest_acm_b%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540361756&rft.eisbn_list=3540361758&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=EBC3072832_24_196&rft_id=info:pmid/&rfr_iscdi=true |