File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: A graph-based optimization algorithm for website topology using interesting association rules

TitleA graph-based optimization algorithm for website topology using interesting association rules
Authors
Issue Date2003
PublisherSpringer.
Citation
7th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD 2003), Seoul, Korea, 30 April - 2 May 2003. In Advances in Knowledge Discovery and Data Mining:7th Pacific-Asia Conference, PAKDD 2003, Seoul, Korea, April 30 – May 2, 2003: Proceedings, 2003, p. 178-190 How to Cite?
Abstract© Springer-Verlag Berlin Heidelberg 2003. 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.
Persistent Identifierhttp://hdl.handle.net/10722/276663
ISBN
ISSN
2023 SCImago Journal Rankings: 0.606
Series/Report no.Lecture Notes in Computer Science ; 2637

 

DC FieldValueLanguage
dc.contributor.authorWu, Edmond H.-
dc.contributor.authorNg, Michael K.-
dc.date.accessioned2019-09-18T08:34:17Z-
dc.date.available2019-09-18T08:34:17Z-
dc.date.issued2003-
dc.identifier.citation7th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD 2003), Seoul, Korea, 30 April - 2 May 2003. In Advances in Knowledge Discovery and Data Mining:7th Pacific-Asia Conference, PAKDD 2003, Seoul, Korea, April 30 – May 2, 2003: Proceedings, 2003, p. 178-190-
dc.identifier.isbn9783540047605-
dc.identifier.issn0302-9743-
dc.identifier.urihttp://hdl.handle.net/10722/276663-
dc.description.abstract© Springer-Verlag Berlin Heidelberg 2003. 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.-
dc.languageeng-
dc.publisherSpringer.-
dc.relation.ispartofAdvances in Knowledge Discovery and Data Mining:7th Pacific-Asia Conference, PAKDD 2003, Seoul, Korea, April 30 – May 2, 2003: Proceedings-
dc.relation.ispartofseriesLecture Notes in Computer Science ; 2637-
dc.titleA graph-based optimization algorithm for website topology using interesting association rules-
dc.typeConference_Paper-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1007/3-540-36175-8_18-
dc.identifier.scopuseid_2-s2.0-7444224696-
dc.identifier.spage178-
dc.identifier.epage190-
dc.publisher.placeBerlin-
dc.identifier.issnl0302-9743-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats