%0 %0 Journal Article %A Chakrabarti, Soumen; Pathak, Amit & Gupta, Manish %D 2010 %T Index design and query processing for graph conductance search %E %B The VLDB Journal %C %I Springer %V %6 %N %P 1-26 %& %Y %S %7 %8 %9 %? %! %Z %@ 1066-8888 %( %) %* %L %M %1 %2 %3 article %4 %# %$ %F chakrabarti2010index %K index, conductance, pagerank, interactive %X Graph conductance queries, also known as personalized PageRank and related to random walks with restarts, were originally proposed to assign a hyperlink-based prestige score to Web pages. More general forms of such queries are also very useful for ranking in entity-relation (ER) graphs used to represent relational, XML and hypertext data. Evaluation of PageRank usually involves a global eigen computation. If the graph is even moderately large, interactive response times may not be possible. Recently, the need for interactive PageRank evaluation has increased. The graph may be fully known only when the query is submitted. Browsing actions of the user may change some inputs to the PageRank computation dynamically. In this paper, we describe a system that analyzes query workloads and the ER graph, invests in limited offline indexing, and exploits those indices to achieve essentially constant-time query processing, even as the graph size scales. Our techniques—data and query statistics collection, index selection and materialization, and query-time index exploitation—have parallels in the extensive relational query optimization literature, but is applied to supporting novel graph data repositories. We report on experiments with five temporal snapshots of the CiteSeer ER graph having 74–702 thousand entity nodes, 0.17–1.16 million word nodes, 0.29–3.26 million edges between entities, and 3.29–32.8 million edges between words and entities. We also used two million actual queries from CiteSeer’s logs. Queries run 3–4 orders of magnitude faster than whole-graph PageRank, the gap growing with graph size. Index size is smaller than a text index. Ranking accuracy is 94–98% with reference to whole-graph PageRank. %Z %U http://dx.doi.org/10.1007/s00778-010-0204-8 %+ %^ %0 %0 Conference Proceedings %A Hotho, Andreas; Jäschke, Robert; Schmitz, Christoph & Stumme, Gerd %D 2006 %T Das Entstehen von Semantik in BibSonomy %E %B Social Software in der Wertschöpfung %C Baden-Baden %I Nomos %V %6 %N %P %& %Y %S %7 %8 %9 %? %! %Z %@ %( %) %* %L %M %1 E:\home\help_of_all_helps.pdf %2 %3 inproceedings %4 %# %$ %F hotho2006das %K tags, semantik, 2006, pagerank, tagging, association, hotho, bibsonomy, schmitz, jaeschke, rules, semantics, stumme, BibSonomy, nepomuk, folksonomy, tagorapub, folksonomies, tagora, folkrank, UniK, ol_web2.0, emergentsemantics_evidence %X Immer mehr Soziale-Lesezeichen-Systeme entstehen im heutigen Web. In solchen Systemen erstellen die Nutzer leichtgewichtige begriffliche Strukturen, so genannte Folksonomies. Ihren Erfolg verdanken sie der Tatsache, dass man keine speziellen Fähigkeiten benötigt, um an der Gestaltung mitzuwirken. In diesem Artikel beschreiben wir unser System BibSonomy. Es erlaubt das Speichern, Verwalten und Austauschen sowohl von Lesezeichen (Bookmarks) als auch von Literaturreferenzen in Form von BibTeX-Einträgen. Die Entwicklung des verwendeten Vokabulars und der damit einhergehenden Entstehung einer gemeinsamen Semantik wird detailliert diskutiert. %Z %U http://www.kde.cs.uni-kassel.de/stumme/papers/2006/hotho2006entstehen.pdf %+ %^ %0 %0 Conference Proceedings %A Hotho, Andreas; Jäschke, Robert; Schmitz, Christoph & Stumme, Gerd %D 2006 %T Information Retrieval in Folksonomies: Search and Ranking %E Sure, York & Domingue, John %B The Semantic Web: Research and Applications %C Heidelberg %I Springer %V 4011 %6 %N %P 411-426 %& %Y %S Lecture Notes in Computer Science %7 %8 June %9 %? %! %Z %@ %( %) %* %L %M %1 hotho2006information.pdf %2 %3 inproceedings %4 %# %$ %F hotho2006information %K 2006, folkrank, folksonomy, graph, iccs_example, information, l3s, mining, ol_web2.0, pagerank, rank, ranking, retrieval, search, seminar2006, testttag, trias_example, webzu, widely_related %X Social bookmark tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. The reason for their immediate success is the fact that no specific skills are needed for participating. At the moment, however, the information retrieval support is limited. We present a formal model and a new search algorithm for folksonomies,called FolkRank, that exploits the structure of the folksonomy. The proposed algorithm is also applied to findcommunities within the folksonomy and is used to structure search results. All findings are demonstrated on a large scale dataset. %Z %U %+ %^ %0 %0 Conference Proceedings %A Hotho, Andreas; Jäschke, Robert; Schmitz, Christoph & Stumme, Gerd %D 2006 %T Trend Detection in Folksonomies %E Avrithis, Yannis S.; Kompatsiaris, Yiannis; Staab, Steffen & O'Connor, Noel E. %B Proc. First International Conference on Semantics And Digital Media Technology (SAMT) %C Heidelberg %I Springer %V 4306 %6 %N %P 56-70 %& %Y %S LNCS %7 %8 December %9 %? %! %Z %@ 3-540-49335-2 %( %) %* %L %M %1 %2 %3 inproceedings %4 %# %$ %F hotho2006trend %K intranet, 2006, trend, pagerank, hotho, schmitz, jaeschke, l3s, itegpub, detection, triadic, stumme, nepomuk, folksonomy, tagorapub, folkrank, UniK %X As the number of resources on the web exceeds by far the number ofdocuments one can track, it becomes increasingly difficult to remainup to date on ones own areas of interest. The problem becomes moresevere with the increasing fraction of multimedia data, from whichit is difficult to extract some conceptual description of theircontents.One way to overcome this problem are social bookmark tools, whichare rapidly emerging on the web. In such systems, users are settingup lightweight conceptual structures called folksonomies, andovercome thus the knowledge acquisition bottleneck. As more and morepeople participate in the effort, the use of a common vocabularybecomes more and more stable. We present an approach for discoveringtopic-specific trends within folksonomies. It is based on adifferential adaptation of the PageRank algorithm to the triadichypergraph structure of a folksonomy. The approach allows for anykind of data, as it does not rely on the internal structure of thedocuments. In particular, this allows to consider different datatypes in the same analysis step. We run experiments on a large-scalereal-world snapshot of a social bookmarking system. %Z %U http://www.kde.cs.uni-kassel.de/stumme/papers/2006/hotho2006trend.pdf %+ %^ %0 %0 Journal Article %A Brin, Sergey & Page, Lawrence %D 1998 %T The Anatomy of a Large-Scale Hypertextual Web Search Engine %E %B Computer Networks and ISDN Systems %C %I %V 30 %6 %N 1-7 %P 107--117 %& %Y %S %7 %8 April %9 %? %! %Z %@ %( %) %* %L %M %1 %2 %3 article %4 %# %$ %F brin1998anatomy %K pagerank %X %Z %U %+ %^