File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/3-540-36175-8_18
- Scopus: eid_2-s2.0-7444224696
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: A graph-based optimization algorithm for website topology using interesting association rules
Title | A graph-based optimization algorithm for website topology using interesting association rules |
---|---|
Authors | |
Issue Date | 2003 |
Publisher | Springer. |
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 Identifier | http://hdl.handle.net/10722/276663 |
ISBN | |
ISSN | 2023 SCImago Journal Rankings: 0.606 |
Series/Report no. | Lecture Notes in Computer Science ; 2637 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Wu, Edmond H. | - |
dc.contributor.author | Ng, Michael K. | - |
dc.date.accessioned | 2019-09-18T08:34:17Z | - |
dc.date.available | 2019-09-18T08:34:17Z | - |
dc.date.issued | 2003 | - |
dc.identifier.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 | - |
dc.identifier.isbn | 9783540047605 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://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.language | eng | - |
dc.publisher | Springer. | - |
dc.relation.ispartof | Advances in Knowledge Discovery and Data Mining:7th Pacific-Asia Conference, PAKDD 2003, Seoul, Korea, April 30 – May 2, 2003: Proceedings | - |
dc.relation.ispartofseries | Lecture Notes in Computer Science ; 2637 | - |
dc.title | A graph-based optimization algorithm for website topology using interesting association rules | - |
dc.type | Conference_Paper | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1007/3-540-36175-8_18 | - |
dc.identifier.scopus | eid_2-s2.0-7444224696 | - |
dc.identifier.spage | 178 | - |
dc.identifier.epage | 190 | - |
dc.publisher.place | Berlin | - |
dc.identifier.issnl | 0302-9743 | - |