Refining Web authoritative resource by frequent structures

Proceedings of the International Database Engineering and Applications Symposium, IDEAS

Volumn , Issue , 2003, Pages 250-255

  Zhou, Haofeng ^a   Lou, Yubo ^a   Yuan, Qingqing ^a   Ng, Wilfred ^b   Wang, Wei ^a   Shi, Baile ^a  

^a FUDAN UNIVERSITY   (China)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

COMMON DATUM; CONVENTIONAL DATABASE; DYNAMIC INFORMATION; FREQUENT PATTERN MINING; NEW APPROACHES; QUALITY OF INFORMATION; RESEARCH RESULTS; WEB RESOURCES;

ALGORITHMS; DATABASE SYSTEMS; HYPERTEXT SYSTEMS; SEARCH ENGINES;

WORLD WIDE WEB;

EID: 13744260084     PISSN: 10988068     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IDEAS.2003.1214934     Document Type: Conference Paper

References (23)

1. R. Agrawal, et al. Mining association rules between sets of items in large databases. In Proc. of SIG-MOD'93, pp. 207-216.
2. R. Agrawal, et al. Fast algorithms for mining association rules in large databases. In Proc. of VLDB'94, pp. 487-499.
3. T. Asai, et al. Efficient substructure discovery from large semi-structured data. In Proc. of SDM'02, pp. 158-174.
4. S. Brin, et al. Dynamic itemset counting and implication rules for market basket data. In Proc. of SIG-MOD'97, pp. 255-264.
5. S. Brin, et al. The anatomy of a large-scale hypertex-tual web search engine. In Proc. of WWW'98, Computer Networks, vol. 30, no. 1-7.
6. S. Chakrabarti, et al. Mining the web's link structure. IEEE Computer, 32(8):60-67, 1999.
7. L. Dehaspe, et al. Finding frequent substructures in chemical compounds. In Proc. of KDD'98, pp. 30-36.
8. D. Florescu, et al. Database techniques for the world-wide web: a survey. ACM SIGMOD Record, 27(3):59-74, 1998.
9. D. Gibson, et al. Inferring web communities from link topology. In Proc. of the 9th ACM conference on Hypertext and hypermedia, pp. 225-234.
10. J. Han, et al. Mining frequent patterns without candidate generation. In Proc. of SIGMOD'00, pp. 1-12.
11. J.D. Herbach. Improving authoritative sources in a hy-perlinked environment via similarity weighting. BSE Thesis, Dept. of Computer Science, Princeton University, 2001.
12. A. Inokuchi, et al. An apriori-based algorithm for mining frequent substructures from graph data. In Proc. of PKDD'2000, LNCS, vol. 1910, pp. 13-23.
13. J. Kleinberg. Authoritative sources in a hyperlinked environment. In Proc. of SODA'98, pp. 668-677.
14. J. Kleinberg. Authoritative sources in a hyperlinked environment. Journal of the ACM, 46(5):604-632, 1999.
15. J. Kleinberg et al. Applications of linear algebra in information retrieval and hypertext analysis. In Proc. of PODS'99, pp. 185-193.
16. R. Kumar, et al. Trawling the web for emerging cyber-communities. In Proc. of WWW'99, Computer Networks, vol. 31, no. 11-16.
17. M. Kuramochi,et al. Frequent subgraph discovery. In Proc. of ICDM'01, pp. 313-320.
18. T. Matsuda, et al. Extension of graph-based induction for general graph structured data. In Proc. of PAKDD'2000, LNCS, vol. 1805, pp. 420-431.
19. J.Park, et al. An effective hash based algorithm for mining association rules. In Proc. of SIGMOD'95, pp. 175-186.
20. P. Reddy, et al. Inferring web communities through relaxed-cocitation and power-laws. In Proc. of the 12th Data Engineering Workshop.
21. K.Wang, et al. Discovering typical structures of documents: A road map approach. In Proc. of SIGIR'98, pp. 146-154.
22. Q. Yuan, et al. Extract frequent pattern from simple graph data. In Proc. of WAIM'2002, LNCS, vol. 2419, pp. 158-169.
23. M. Zaki. Efficiently mining frequent trees in a forest. In Proc. of SIGKDD'02.