| Web projections: learning from contextual subgraphs of the web |
| Full text |
Pdf
(313 KB)
|
Source
|
International World Wide Web Conference
archive
Proceedings of the 16th international conference on World Wide Web
table of contents
Banff, Alberta, Canada
SESSION: Web graphs
table of contents
Pages: 471 - 480
Year of Publication: 2007
ISBN:978-1-59593-654-7
|
|
Authors
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 8, Downloads (12 Months): 77, Citation Count: 6
|
|
|
ABSTRACT
Graphical relationships among Web pages have been exploited inmethods for ranking search results. To date, specific graphicalproperties have been used in these analyses. We introduce a WebProjection methodology that generalizes prior efforts of graphicalrelationships of the web in several ways. With the approach, wecreate subgraphs by projecting sets of pages and domains onto thelarger web graph, and then use machine learning to constructpredictive models that consider graphical properties as evidence. Wedescribe the method and then present experiments that illustrate theconstruction of predictive models of search result quality and userquery reformulation.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
Chris Burges , Tal Shaked , Erin Renshaw , Ari Lazier , Matt Deeds , Nicole Hamilton , Greg Hullender, Learning to rank using gradient descent, Proceedings of the 22nd international conference on Machine learning, p.89-96, August 07-11, 2005, Bonn, Germany
[doi> 10.1145/1102351.1102363]
|
| |
2
|
|
| |
3
|
D. M. Chickering. The winmine toolkit. Technical Report MSR-TR-2002-103, Microsoft, 2002.
|
| |
4
|
|
 |
5
|
|
| |
6
|
|
| |
7
|
E. Garfield. Citation analysis as a tool in journal evaluation. Science, 178(60):471--479, November 1972.
|
 |
8
|
|
 |
9
|
|
 |
10
|
|
| |
11
|
R. M. Karp. Reducibility among combinatorial problems. In Complexity of Computer Computations, pages 85--103. 1972.
|
| |
12
|
H. Kashima, K. Tsuda, and A. Inokuchi. Marginalized kernels between labeled graphs. In ICML '03, 2003.
|
 |
13
|
|
| |
14
|
|
| |
15
|
T. Kudo, E. Maeda, and Y. Matsumoto. An application of boosting to graph classification. In NIPS '05. 2005.
|
| |
16
|
|
| |
17
|
J. Leskovec, N. Milic-Frayling, and M. Grobelnik. Impact of linguistic analysis on the semantic graph coverage and learning of document extracts. In AAAI '05, 2005.
|
 |
18
|
|
 |
19
|
|
 |
20
|
|
| |
21
|
L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. Technical report, Stanford Dig. Lib. Tech. Proj., 1998.
|
| |
22
|
G. Pinski and F. Narin. Citation influence for journal aggregates of scientific publications: Theory, with application to the literature of physics. Information Processing and Management, 12:297--312, 1976.
|
 |
23
|
|
| |
24
|
M. Richardson and P. Domingos. The intelligent surfer: Probabilistic combination of link and content information in pagerank. In NIPS '02, 2002.
|
 |
25
|
|
| |
26
|
S. Wasserman, K. Faust, and D. Iacobucci. Social Network Analysis: Methods and Applications. Cambridge University Press, 1994.
|
 |
27
|
|
 |
28
|
Wensi Xi , Benyu Zhang , Zheng Chen , Yizhou Lu , Shuicheng Yan , Wei-Ying Ma , Edward Allan Fox, Link fusion: a unified link analysis framework for multi-type interrelated data objects, Proceedings of the 13th international conference on World Wide Web, May 17-20, 2004, New York, NY, USA
[doi> 10.1145/988672.988715]
|
CITED BY 6
|
|
|
|
|
|
|
|
|
|
|
Xiaolin Shi , Matthew Bonner , Lada A. Adamic , Anna C. Gilbert, The very small world of the well-connected, Proceedings of the nineteenth ACM conference on Hypertext and hypermedia, June 19-21, 2008, Pittsburgh, PA, USA
|
|
|
|
|
|
|
|