Searching Steiner trees for web graph query

Computers and Industrial Engineering

Volumn 62, Issue 3, 2012, Pages 732-739

  Lee, Wookey ^a   Loh, Woong Kee ^b   Sohn, Mye M ^c  

^a Inha University   (South Korea)

^b Sungkyul University   (South Korea)

^c Sungkyunkwan University   (South Korea)

Author keywords

Linear Programming; PageRank; Search engine; Steiner tree; tf idf

Indexed keywords

EDGE WEIGHTS; EXECUTION TIME; EXPERIMENTAL STUDIES; HYPERLINKS; INFORMATION SOURCES; LINEAR PROGRAMMING MODELS; PAGERANK; QUALITY OF RESULTS; RANKING MEASURES; STEINER TREES; TF-IDF; WEB DATABASE; WEB GRAPHS; WEB OBJECTS;

COMPUTER PROGRAMMING; FORESTRY; HYPERTEXT SYSTEMS; INFORMATION TECHNOLOGY; LINEAR PROGRAMMING; SEARCH ENGINES; WEBSITES;

TREES (MATHEMATICS);

ALGORITHMS; COMPUTER PROGRAMING; FORESTRY; INFORMATION RETRIEVAL; INTERNET;

EID: 84862791797     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2011.11.013     Document Type: Article

References (31)

1. W. Bosques, R. Rodriguez, A. Rondon, and R. Vasquez A spatial data retrieval and image processing expert system for the world wide web Computers and Industrial Engineering 33 1 1997 433 436 (Pubitemid 127404406)
2. P.Y. Chao, and T.T. Chen Analysis of assembly through product configuration Computers and Industrial Engineering 44 2001 189 203 (Pubitemid 32160806)
3. R. Cilibrasi, and P. Vitányi The Google similarity distance IEEE Transactions on Knowledge and Data Engineering 19 3 2007 370 383 (Pubitemid 46374534)
4. Eiron, N.; McCurley, K.; & Tomlin, J. (2004). Ranking the web frontier. In Proc world wide web (pp. 309-318). (Pubitemid 40752765)
5. Faloutsos, M.; Faloutsos, P.; & Faloutsos, C. (1999). On power-law relationships of the internet topology. In Proc SIGCOMM (pp. 251-262). (Pubitemid 32081870)
6. J. Garofalakis, P. Kappos, and D. Mourloukos Web site optimization using page popularity IEEE Internet Computing 3 4 1999 22 29
7. P.A. Gloor, and S.B. Dynes Cybermap- Visually navigating the web Journal of Visual Languages and Computing 9 3 1998 319 336
8. M. Hammami, Y. Chahir, and L. Chen WebGuard: A web filtering engine combining textual, structural, and visual content-based analysis IEEE Transactions on Knowledge and Data Engineering 18 2 2006 272 284
9. J. Hou, and Y. Zhang Effective finding relevant web pages from linkage information IEEE Transactions on Knowledge and Data Engineering 15 4 2003 940 951
10. C.C. Hsu, and S.L. Hwang A study of interface design improvement in an engineering data management system on the world wide web Computers and Industrial Engineering 47 1 2004 31 43
11. P. Jaillet A priori solution of a traveling salesman problem in which a random subset of the customers are visited Operations Research 36 6 1988 929 936
12. Kleinberg, J. M.; & Tardos, E. (2008). Balanced outcomes in social exchange networks. In Proc STOC (pp. 295-304).
13. A. Langville, and C. Meyer A reordering for the PageRank problem SIAM Journal on Scientific Computing 27 6 2006 2112 2120 (Pubitemid 44784230)
14. Lee, W.; Song, J. J.; & Leung, C. (2011). Categorical data skyline using classification tree. In Proc APweb (pp. 181-187).
15. Lee, W.; Lee, James J.-H.; Kim, Y.; & Leung, C. K.-S. (2009). AnchorWoman: Top-k structured mobile web search engine. In Proc CIKM (pp. 2089-2090).
16. W. Lee, S. Kang, S. Lim, M. Shin, and Y. Kim Adaptive hierarchical surrogate for searching web with mobile devices IEEE Transactions on Consumer Electronics 53 2 2007 796 803 (Pubitemid 47215103)
17. W. Lee, C.S. Leung, and J.J. Lee Mobile web navigation in digital ecosystems using rooted directed trees IEEE Transactions on Industrial Electronics 58 6 2011 2154 2162
18. W. Lee, and T. Lim Architectural measurements on the world wide web as a graph Journal of Information Technology and Architecture 4 1 2007 61 69
19. Li, W.; Candan, K.; Vu, Q.; & Agrawal, D. (2001). Retrieving and organizing webpages by 'information unit'. In Proc WWW (pp. 230-244).
20. C. Lin Optimal web site reorganization considering information overload and search depth European Journal of Operational Research 173 3 2006 839 848 (Pubitemid 43866330)
21. Murat, C.; & Paschos, V. T. (1999). The probabilistic longest path problem. In Proc networks (Vol. 33, pp. 207-219). (Pubitemid 129320701)
22. P. O'Grady, and W.-Y. Liang An internet-based search formalism for design with modules Computers and Industrial Engineering 35 1-2 1998 13 16 (Pubitemid 128457077)
23. Pandurangan, G.; Raghavan, P.; & Upfal, E. (2002). Using PageRank to characterize web structure. In Proc COCOON (pp. 330-339).
24. S. Pilarski, and T. Kameda Simple bounds on the convergence rate of an ergodic Markov chain Information Processing Letters 45 2 1993 81 87 (Pubitemid 23639205)
25. E. Ravasz, and A.L. Barabasi Hierarchical organization in complex networks Physical Review 67 2003
26. Spielman, M. M.; & Teng, S. H. (2001). Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. In Proc STOC (pp. 296-305).
27. R.E. Tarjan Sensitivity analysis of minimum spanning trees and shortest path trees Information Processing Letters 14 1 1982 30 33
28. Vu, Q. H.; Ooi, B. C.; Papadias, D.; & Tung, A. K. H. (2008). A graph method for keyword-based selection of the top-k databases. In Proc SIGMOD (pp. 915-926).
29. Weigel, F.; Panda, B.; Riedewald, M.; Gehrke, J.; & Calimlim, M. (2008). Large-scale collaborative analysis and extraction of web data. In Proc VLDB (pp. 1476-1479).
30. Xue, G.; Zeng, H.; Chen, Z.; Ma, W.; Zhang, H.; & Lu, C. (2003). Implicit link analysis for small web search. In Proc SIGIR (pp. 56-63).
31. Zhang, Y.; Lin, X.; Zhu, G.; Zhang, W.; & Lin, Q. (2010). Efficient rank based KNN query processing over uncertain data. In Proc ICDE (pp. 28-39).