-
Yang, C.C.; Liu, N.: Web site topic-hierarchy generation based on link structure (2009)
0.01
0.0079802675 = product of:
0.035911202 = sum of:
0.025951253 = product of:
0.051902507 = sum of:
0.051902507 = weight(_text_:web in 2738) [ClassicSimilarity], result of:
0.051902507 = score(doc=2738,freq=18.0), product of:
0.09596372 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.02940506 = queryNorm
0.5408555 = fieldWeight in 2738, product of:
4.2426405 = tf(freq=18.0), with freq of:
18.0 = termFreq=18.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.0390625 = fieldNorm(doc=2738)
0.5 = coord(1/2)
0.009959949 = product of:
0.019919898 = sum of:
0.019919898 = weight(_text_:22 in 2738) [ClassicSimilarity], result of:
0.019919898 = score(doc=2738,freq=2.0), product of:
0.10297151 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.02940506 = 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.22222222 = coord(2/9)
- 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
-
Barabási, A.-L.: Linked: The New Science of Networks (2002)
0.01
0.006951045 = product of:
0.0625594 = sum of:
0.0625594 = sum of:
0.012110585 = weight(_text_:web in 2015) [ClassicSimilarity], result of:
0.012110585 = score(doc=2015,freq=2.0), product of:
0.09596372 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.02940506 = queryNorm
0.12619963 = fieldWeight in 2015, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.02734375 = fieldNorm(doc=2015)
0.05044882 = weight(_text_:seite in 2015) [ClassicSimilarity], result of:
0.05044882 = score(doc=2015,freq=4.0), product of:
0.16469958 = queryWeight, product of:
5.601063 = idf(docFreq=443, maxDocs=44218)
0.02940506 = queryNorm
0.30630812 = fieldWeight in 2015, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
5.601063 = idf(docFreq=443, maxDocs=44218)
0.02734375 = fieldNorm(doc=2015)
0.11111111 = coord(1/9)
- Footnote
- Rez. in: nfd 54(2003) H.8, S.497 (T. Mandl): "Gesetze der digitalen Anarchie - Hyperlinks im Internet entstehen als Ergebnis sozialer Prozesse und können auch als formaler Graph im Sinne der Mathematik interpretiert werden. Die Thematik Hyperlinks ist im Information Retrieval höchst aktuell, da Suchmaschinen die Link-Struktur bei der Berechnung ihrer Ergebnisse berücksichtigen. Algorithmen zur Bestimmung des "guten Rufs" einer Seite wie etwa PageRank von Google gewichten eine Seite höher, wenn viele links auf sie verweisen. Barabási erklärt dem Leser seines Buches darüber hinaus noch, wie es zu solchen Phänomenen kommt. Soziale Prozesse im Netz wirken so, dass bereits bekannte Seiten mit größerer Wahrscheinlichkeit auch wieder weitere Links oder neue Besucher anziehen. Barabási ist Physiker an der Notre-Dame University und ihm fehlt ebenso wie Huberman die informationswissenschaftliche Perspektive. Er fragt also kaum, wie kann das Wissen über Netzwerke zu Verbesserungen in Informationssystemen führen, die Benutzerbedürfnisse besser erfüllen. Gleichwohl lohnt sich die Lektüre auch für Informationswissenschaftler. Barabäsi stellt die aktuelle Forschung zur Netzwerkstruktur des Internets auf einfache Weise fast ohne Zugeständnisse an Aktualität und Komplexität dar. Wie Huberman verzichtet auch er weitgehend auf Formeln und andere Formalismen. Der in Ungarn geborene Barabási lässt darüber hinaus keine Anekdote aus, sei es über die Begründer der Graphen-Theorie, im peer-review abgelehnte Beiträge und persönliche Begegnungen mit anderen Forschern. Barabási beginnt mit einfachen Netzwerkstrukturen und schreitet didaktisch über internet-ähnliche Netzwerke weiter zu Anwendungen und praktischen Beispielen aus unterschiedlichsten Disziplinen. Er schafft mit seinem Buch "Linked" unter anderem Links zwischen der ungarischen Literatur, dem I-Love-You Computer-Virus, der Verbreitung von Aids, den Theorien Einsteins, den Aufsichtsräten der wichtigsten amerikanischen Firmen, dem Al-Qaeda-Netzwerk und der Struktur und der Funktion biologischer Zellen. Zu Beginn seines Buches berichtet Barabási von sogenannten kleinen Welten, in denen viele Objekte über wenige Verbindungen zusammenhängen. Ein Blick in den eigenen größeren Bekanntenkreis mag bestätigen, dass viele Menschen über wenige Schritte zwischen Bekannten erreichbar sind. Sowohl Barabäsi als auch Huberman gehen auf die Geschichte des ersten sozialwissenschaftlichen Experiments zu diesem Thema ein, das in den 1960er Jahren versuchte, die Anzahl von Schritten zwischen gemeinsamen Bekannten zu bestimmen, welche vom Mittleren Westen der USA an die Ostküste führt. Die genauere Struktur solcher Systeme, in denen manche Knoten weitaus mehr Beziehungen zu anderen eingehen als der Durchschnitt, führt hin zum Internet. Im Web lässt sich keineswegs immer ein Pfad zwischen zwei Knoten finden, wie noch vor wenigen Jahren vermutet wurde. Die durchschnittliche Entfernung war damals noch mit 19 Klicks berechnet worden. Vielmehr herrscht eine differenziertere Struktur, die Barabási vorstellt und in der zahlreiche Seiten in Sackgassen führen. Huberman wie Barabási diskutieren auch negative Aspekte des Internet. Während Huberman die Wartezeiten und Staus bei Downloads analysiert, bespricht Barabási die rasante Verbreitung von ComputerViren und weist auf die Grundlagen für diese Gefährdung hin. Das vorletzte Kapitel widmen übrigens beide Autoren den Märkten im Internet. Spätestens hier werden die wirtschaftlichen Aspekte von Netzwerken deutlich. Beide Titel führen den Leser in die neue Forschung zur Struktur des Internet als Netzwerk und sind leicht lesbar. Beides sind wissenschaftliche Bücher, wenden sich aber auch an den interessierten Laien. Das Buch von Barabási ist etwas aktueller, plauderhafter, länger, umfassender und etwas populärwissenschaftlicher."
-
Felker, K.: Ariadne's thread : hypertext, writing, and the World Wide Web (2002)
0.00
0.0030757042 = product of:
0.027681338 = sum of:
0.027681338 = product of:
0.055362675 = sum of:
0.055362675 = weight(_text_:web in 2832) [ClassicSimilarity], result of:
0.055362675 = score(doc=2832,freq=8.0), product of:
0.09596372 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.02940506 = queryNorm
0.5769126 = fieldWeight in 2832, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.0625 = fieldNorm(doc=2832)
0.5 = coord(1/2)
0.11111111 = coord(1/9)
- Abstract
- Examines the concept of hypertext and how it relates to the World Wide Web, along with a discussion of why this is important to librarians. Includes examples of library Web pages and products that take advantage of the medium and some that do not, along with a specific discussion of crafting text, structure and linking for the Web.
-
Kinnell, S.K.; Franklin, C.: Hypertext and hypercard : early development (2009)
0.00
0.0026912412 = product of:
0.02422117 = sum of:
0.02422117 = product of:
0.04844234 = sum of:
0.04844234 = weight(_text_:web in 3788) [ClassicSimilarity], result of:
0.04844234 = score(doc=3788,freq=8.0), product of:
0.09596372 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.02940506 = queryNorm
0.50479853 = fieldWeight in 3788, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.0546875 = fieldNorm(doc=3788)
0.5 = coord(1/2)
0.11111111 = coord(1/9)
- Abstract
- The ease of linking and hopping from one text to another that we associate today with the World Wide Web was implemented in a different context prior to the Web. The creation of "hypertext" has a long and interesting history prior to the Web, as this article demonstrates. At the time it was issued, the HyperCard software application was expected to be the foundation of a widely-used new means of information organization. We can see now that the key ideas of hypertext were present in HyperCard, without the ease of use of subsequent World Wide Web features.
-
Tredinnick, L.: Post-structuralism, hypertext, and the World Wide Web (2007)
0.00
0.0023306834 = product of:
0.02097615 = sum of:
0.02097615 = product of:
0.0419523 = sum of:
0.0419523 = weight(_text_:web in 650) [ClassicSimilarity], result of:
0.0419523 = score(doc=650,freq=6.0), product of:
0.09596372 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.02940506 = queryNorm
0.43716836 = fieldWeight in 650, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.0546875 = fieldNorm(doc=650)
0.5 = coord(1/2)
0.11111111 = coord(1/9)
- Abstract
- Purpose - The purpose of this paper is to explore the application of post-structuralist theory to understanding hypertext and the World Wide Web, and the challenge posed by digital information technology to the practices of the information profession. Design/methodology/approach - The method adopted is that of a critical study. Findings - The paper argues for the importance of post-structuralism for an understanding of the implications of digital information for the information management profession. Originality/value - Focuses on an epistemological gap between the traditional practices of the information profession, and the structure of the World Wide Web.
-
Amitay, E.: Trends, fashions, patterns, norms, conventions and hypertext too (2001)
0.00
0.0021748515 = product of:
0.019573662 = sum of:
0.019573662 = product of:
0.039147325 = sum of:
0.039147325 = weight(_text_:web in 5192) [ClassicSimilarity], result of:
0.039147325 = score(doc=5192,freq=4.0), product of:
0.09596372 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.02940506 = queryNorm
0.4079388 = fieldWeight in 5192, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.0625 = fieldNorm(doc=5192)
0.5 = coord(1/2)
0.11111111 = coord(1/9)
- Abstract
- At a finer level, Amitay speculates about the use of language on the Web. The Web may be one large corpus of text, but she suggests that communities will express themselves by the conventions used for writing hypertext. It may be that new information technologies will spawn new communities.
-
Maislin, S.: Ripping out the pages (2000)
0.00
0.0016647738 = product of:
0.014982964 = sum of:
0.014982964 = product of:
0.029965928 = sum of:
0.029965928 = weight(_text_:web in 220) [ClassicSimilarity], result of:
0.029965928 = score(doc=220,freq=6.0), product of:
0.09596372 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.02940506 = queryNorm
0.3122631 = fieldWeight in 220, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.0390625 = fieldNorm(doc=220)
0.5 = coord(1/2)
0.11111111 = coord(1/9)
- Abstract
- When the Web was invented, it was touted as a novel nonlinear medium for the written word. No longer would we be constrained by linear presentations! Hyperlinks would allow us to jump haphazardly from page to page, chapter to chapter, idea to idea! Texts would no longer need to run from beginning to end! This is misleading. A printed book is also multidimensional and potentially nonlinear. We can open it to any page, from any other page, for any reason. We can open several books at once. In fact, what makes a book special is its combination of linear structure (the order of the words) and nonlinear physicality (the bound papers). This linear/nonlinear duality is enhanced further by the index, which maps linearly sequenced pages in a nonlinear, informationally ordered structure (architecture). In truth, the online environment is crippled by an absence of linear structure. Imagine selecting a hard cover book, tearing off the covers, ripping pages into small pieces, and throwing them in a box. That box is like a computer file system, and the paper scraps are Web documents. Only one scrap can be retrieved from the box at a time, and it must be replaced before another can be accessed. Page numbers are meaningless. Global context is destroyed. And without page numbers or context, what happens to the index?
- Issue
- Beyond book indexing: how to get started in Web indexing, embedded indexing and other computer-based media. Ed. by D. Brenner u. M. Rowland.
-
Karampiperis, P.; Sampson, D.: Supporting accessible hypermedia in web-based educational systems : defining an accessibility application profile for learning resources (2004)
0.00
0.0016311385 = product of:
0.014680246 = sum of:
0.014680246 = product of:
0.029360492 = sum of:
0.029360492 = weight(_text_:web in 5924) [ClassicSimilarity], result of:
0.029360492 = score(doc=5924,freq=4.0), product of:
0.09596372 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.02940506 = queryNorm
0.3059541 = fieldWeight in 5924, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.046875 = fieldNorm(doc=5924)
0.5 = coord(1/2)
0.11111111 = coord(1/9)
- Abstract
- The design and development of web-based educational systems for people with special abilities have recently attracted the attention of the research community. However, although a number of systems that claim to meet accessibility needs and preferences are proposed, most of them are typically supported by hypermedia and multimedia educational content that is specially designed for the user targeted group. Such approaches prevent their user groups (both learners and their tutors) from accessing other available resources. Therefore, it is important to be able to built generic e-learning systems that would allow the reuse of existing learning resources in different accessibility demanding applications. To this end, in this article we propose a methodology for defining an accessibility application profile that captures the accessibility properties of learning objects in a standard form and we examine its application to the IEEE Learning Object Metadata (LOM) standard.
-
Picard, J.; Savoy, J.: Enhancing retrieval with hyperlinks : a general model based on propositional argumentation systems (2003)
0.00
0.0013592821 = product of:
0.012233539 = sum of:
0.012233539 = product of:
0.024467077 = sum of:
0.024467077 = weight(_text_:web in 1427) [ClassicSimilarity], result of:
0.024467077 = score(doc=1427,freq=4.0), product of:
0.09596372 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.02940506 = queryNorm
0.25496176 = fieldWeight in 1427, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.0390625 = fieldNorm(doc=1427)
0.5 = coord(1/2)
0.11111111 = coord(1/9)
- 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.
-
Heo, M.; Hirtle, S.C.: ¬An empirical comparison of visualization tools to assist information retrieval on the Web (2001)
0.00
0.001331819 = product of:
0.011986371 = sum of:
0.011986371 = product of:
0.023972742 = sum of:
0.023972742 = weight(_text_:web in 5215) [ClassicSimilarity], result of:
0.023972742 = score(doc=5215,freq=6.0), product of:
0.09596372 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.02940506 = queryNorm
0.24981049 = fieldWeight in 5215, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.03125 = fieldNorm(doc=5215)
0.5 = coord(1/2)
0.11111111 = coord(1/9)
- Abstract
- The reader of a hypertext document in a web environment, if maximum use of the document is to be obtained, must visualize the overall structure of the paths through the document as well as the document space. Graphic visualization displays of this space, produced to assist in navigation, are classified into four groups, and Heo and Hirtle compare three of these classes as to their effectiveness. Distortion displays expand regions of interest while relatively diminishing the detail of the remaining regions. This technique will show both local detail and global structure. Zoom techniques use a series of increasingly focused displays of smaller and smaller areas, and can reduce cogitative overload, but do not provide an easy movement to other parts of the total space. Expanding outline displays use a tree structure to allow movement through a hierarchy of documents, but if the organization has a wide horizontal structure, or is not particularly hierarchical in nature such display can break down. Three dimensional layouts, which are not evaluated here, place objects by location in three space, providing more information and freedom. However, the space must be represented in two dimensions resulting in difficulty in visually judging depth, size and positioning. Ten students were assigned to each of eight groups composed of viewers of the three techniques and an unassisted control group using either a large (583 selected pages) or a small (50 selected pages) web space. Sets of 10 questions, which were designed to elicit the use of a visualization tool, were provided for each space. Accuracy and time spent were extracted from a log file. Users views were also surveyed after completion. ANOVA shows significant differences in accuracy and time based upon the visualization tool in use. A Tukey test shows zoom accuracy to be significantly less than expanding outline and zoom time to be significantly greater than both the outline and control groups. Size significantly affected accuracy and time, but had no interaction with tool type. While the expanding tool class out performed zoom and distortion, its performance was not significantly different from the control group.
-
Ihadjadene, M.; Bouché, R.; Zâafrani, R.: ¬The dynamic nature of searching and browsing on Web-OPACs : the CATHIE experience (2000)
0.00
9.611576E-4 = product of:
0.008650418 = sum of:
0.008650418 = product of:
0.017300837 = sum of:
0.017300837 = weight(_text_:web in 118) [ClassicSimilarity], result of:
0.017300837 = score(doc=118,freq=2.0), product of:
0.09596372 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.02940506 = queryNorm
0.18028519 = fieldWeight in 118, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.0390625 = fieldNorm(doc=118)
0.5 = coord(1/2)
0.11111111 = coord(1/9)
