-
Yang, C.C.; Liu, N.: Web site topic-hierarchy generation based on link structure (2009)
0.04
0.0411472 = product of:
0.061720796 = sum of:
0.045419876 = weight(_text_:search in 2738) [ClassicSimilarity], result of:
0.045419876 = score(doc=2738,freq=4.0), product of:
0.1672694 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.048125703 = queryNorm
0.27153727 = fieldWeight in 2738, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.0390625 = fieldNorm(doc=2738)
0.01630092 = product of:
0.03260184 = sum of:
0.03260184 = weight(_text_:22 in 2738) [ClassicSimilarity], result of:
0.03260184 = score(doc=2738,freq=2.0), product of:
0.168528 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.048125703 = queryNorm
0.19345059 = fieldWeight in 2738, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0390625 = fieldNorm(doc=2738)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- Navigating through hyperlinks within a Web site to look for information from one of its Web pages without the support of a site map can be inefficient and ineffective. Although the content of a Web site is usually organized with an inherent structure like a topic hierarchy, which is a directed tree rooted at a Web site's homepage whose vertices and edges correspond to Web pages and hyperlinks, such a topic hierarchy is not always available to the user. In this work, we studied the problem of automatic generation of Web sites' topic hierarchies. We modeled a Web site's link structure as a weighted directed graph and proposed methods for estimating edge weights based on eight types of features and three learning algorithms, namely decision trees, naïve Bayes classifiers, and logistic regression. Three graph algorithms, namely breadth-first search, shortest-path search, and directed minimum-spanning tree, were adapted to generate the topic hierarchy based on the graph model. We have tested the model and algorithms on real Web sites. It is found that the directed minimum-spanning tree algorithm with the decision tree as the weight learning algorithm achieves the highest performance with an average accuracy of 91.9%.
- Date
- 22. 3.2009 12:51:47
-
Fraser, L.; Locatis, C.: Effects of link annotations on search performance in layered and unlayered hierarchically organized information spaces (2001)
0.02
0.021411134 = product of:
0.0642334 = sum of:
0.0642334 = weight(_text_:search in 6937) [ClassicSimilarity], result of:
0.0642334 = score(doc=6937,freq=8.0), product of:
0.1672694 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.048125703 = queryNorm
0.3840117 = fieldWeight in 6937, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.0390625 = fieldNorm(doc=6937)
0.33333334 = coord(1/3)
- Abstract
- The effects of link annotations on user search performance in hypertext environments having deep (layered) and shallow link structures were investigated in this study. Four environments were tested-layered-annotated, layered-unannotated, shallow-annotated, and shallow-unannotated. A single document was divided into 48 sections, and layered and unlayered versions were created. Additional versions were created by adding annotations to the links in the layered and unlayered versions. Subjects were given three queries of varying difficulty and then asked to find the answers to the queries that were contained within the hypertext environment to which they were randomly assigned. Correspondence between the wording links and queries was used to define difficulty level. The results of the study confirmed previous research that shallow link structures are better than deep (layered) link structures. Annotations had virtually no effect on the search performance of the subjects. The subjects performed similarly in the annotated and unannotated environments, regardless of whether the link structures were shallow or deep. An analysis of question difficulty suggests that the wording in links has primacy over the wording in annotations in influencing user search behavior.
-
Melucci, M.: Making digital libraries effective : automatic generation of links for similarity search across hyper-textbooks (2004)
0.01
0.01284668 = product of:
0.03854004 = sum of:
0.03854004 = weight(_text_:search in 2226) [ClassicSimilarity], result of:
0.03854004 = score(doc=2226,freq=2.0), product of:
0.1672694 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.048125703 = queryNorm
0.230407 = fieldWeight in 2226, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.046875 = fieldNorm(doc=2226)
0.33333334 = coord(1/3)
-
Picard, J.; Savoy, J.: Enhancing retrieval with hyperlinks : a general model based on propositional argumentation systems (2003)
0.01
0.010705567 = product of:
0.0321167 = sum of:
0.0321167 = weight(_text_:search in 1427) [ClassicSimilarity], result of:
0.0321167 = score(doc=1427,freq=2.0), product of:
0.1672694 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.048125703 = queryNorm
0.19200584 = fieldWeight in 1427, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.0390625 = fieldNorm(doc=1427)
0.33333334 = coord(1/3)
- Abstract
- Fast, effective, and adaptable techniques are needed to automatically organize and retrieve information an the ever-increasing World Wide Web. In that respect, different strategies have been suggested to take hypertext links into account. For example, hyperlinks have been used to (1) enhance document representation, (2) improve document ranking by propagating document score, (3) provide an indicator of popularity, and (4) find hubs and authorities for a given topic. Although the TREC experiments have not demonstrated the usefulness of hyperlinks for retrieval, the hypertext structure is nevertheless an essential aspect of the Web, and as such, should not be ignored. The development of abstract models of the IR task was a key factor to the improvement of search engines. However, at this time conceptual tools for modeling the hypertext retrieval task are lacking, making it difficult to compare, improve, and reason an the existing techniques. This article proposes a general model for using hyperlinks based an Probabilistic Argumentation Systems, in which each of the above-mentioned techniques can be stated. This model will allow to discover some inconsistencies in the mentioned techniques, and to take a higher level and systematic approach for using hyperlinks for retrieval.
-
E-Text : Strategien und Kompetenzen. Elektronische Kommunikation in Wissenschaft, Bildung und Beruf (2001)
0.00
0.0043469123 = product of:
0.013040736 = sum of:
0.013040736 = product of:
0.026081473 = sum of:
0.026081473 = weight(_text_:22 in 622) [ClassicSimilarity], result of:
0.026081473 = score(doc=622,freq=2.0), product of:
0.168528 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.048125703 = queryNorm
0.15476047 = fieldWeight in 622, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03125 = fieldNorm(doc=622)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- Date
- 12. 8.2012 18:05:22
