<rdf:RDF xmlns:community="http://www.bibsonomy.org/ontologies/2008/05/community#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:admin="http://webns.net/mvcb/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:cc="http://web.resource.org/cc/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" xmlns:swrc="http://swrc.ontoware.org/ontology#" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xml:base="http://www.bibsonomy.org/tag/link"><owl:Ontology rdf:about=""><rdfs:comment>BibSonomy publications for /tag/link</rdfs:comment><owl:imports rdf:resource="http://swrc.ontoware.org/ontology/portal"/></owl:Ontology><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/27af62b3cea6efe4eb047cd8b3a12dedc/griesbau"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/27af62b3cea6efe4eb047cd8b3a12dedc/griesbau"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://www.pnas.org/cgi/reprint/99/8/5207.pdf"/><swrc:date>Fri Apr 25 12:21:04 CEST 2008</swrc:date><swrc:booktitle>Proceedings of the National Academy of Sciences</swrc:booktitle><swrc:number>8</swrc:number><swrc:pages>5207-5211</swrc:pages><swrc:title>Winners don&#039;t take all: Characterizing the competition for links on the web</swrc:title><swrc:volume>99</swrc:volume><swrc:year>2002</swrc:year><swrc:keywords>Link analysis </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="David Pennock"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Gary Flake"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Steve Lawrence"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Eric Glover"/></rdf:_4><rdf:_5><swrc:Person swrc:name="C. Lee Giles"/></rdf:_5></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/251de82cc6a8ca274cfe12bda6d365df7/smicha"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/251de82cc6a8ca274cfe12bda6d365df7/smicha"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/B6V1D-3VXSM50-6/1/12ed7f7c77c526a9b156ed582f479fe7"/><swrc:date>Wed Apr 23 22:05:04 CEST 2008</swrc:date><swrc:journal>Statistics \&amp; Probability Letters</swrc:journal><swrc:month>Feb</swrc:month><swrc:number>4</swrc:number><swrc:pages>379--382</swrc:pages><swrc:title>Analysis of goodness-of-fit for Cox regression model</swrc:title><swrc:volume>41</swrc:volume><swrc:year>1999</swrc:year><swrc:keywords>Log-log link </swrc:keywords><swrc:day>15</swrc:day><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Sin-Ho Jung"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Sam Wieand"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2871da0c633c6b5236678ff375e948d94/smicha"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2871da0c633c6b5236678ff375e948d94/smicha"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/B6V0M-4B0NNVW-1/1/bde9404c09a4e66b86f15f75d398e265"/><swrc:date>Wed Apr 23 22:05:04 CEST 2008</swrc:date><swrc:journal>Journal of Statistical Planning and Inference</swrc:journal><swrc:month>Jan</swrc:month><swrc:number>1</swrc:number><swrc:pages>1--12</swrc:pages><swrc:title>Pairwise conditional score functions: a generalization of the Mantel-Haenszel
	estimator</swrc:title><swrc:volume>128</swrc:volume><swrc:year>2005</swrc:year><swrc:keywords>Canonical function link </swrc:keywords><swrc:day>15</swrc:day><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Yoshinori Fujii"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Takemi Yanagimoto"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/295ef10478f0a27ab4f3cb85352e50497/smicha"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/295ef10478f0a27ab4f3cb85352e50497/smicha"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/B6V8V-3W78KC6-2/1/8b8b41e2af1f47a0a25ff174da3fd736"/><swrc:date>Wed Apr 23 14:55:19 CEST 2008</swrc:date><swrc:journal>Computational Statistics \&amp; Data Analysis</swrc:journal><swrc:month>Mar</swrc:month><swrc:number>1</swrc:number><swrc:pages>13--17</swrc:pages><swrc:title>The lower bound method in probit regression</swrc:title><swrc:volume>30</swrc:volume><swrc:year>1999</swrc:year><swrc:keywords>regression link and probit Probit function </swrc:keywords><swrc:day>28</swrc:day><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Dankmar B{\&#034;o}hning"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2ba3e2ed5a9635317245a6e12f4525f49/smicha"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2ba3e2ed5a9635317245a6e12f4525f49/smicha"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/B6V8V-492W00G-2/1/fd428d0c1da647602b69ef274e6d51a1"/><swrc:date>Wed Apr 23 14:55:19 CEST 2008</swrc:date><swrc:journal>Computational Statistics \&amp; Data Analysis</swrc:journal><swrc:month>Oct</swrc:month><swrc:number>1-2</swrc:number><swrc:pages>409--418</swrc:pages><swrc:title>Web-based statistical system by using the DLL</swrc:title><swrc:volume>44</swrc:volume><swrc:year>2003</swrc:year><swrc:keywords>library Dynamic (DLL) link </swrc:keywords><swrc:day>28</swrc:day><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Chooichiro Asano"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Akinobu Takeuchi"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2901b25bf2975ff1a5da9a5168fa0b7d3/smicha"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2901b25bf2975ff1a5da9a5168fa0b7d3/smicha"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/B6V8V-4N987WB-1/1/0689acde37d6259061bcf14058a5f049"/><swrc:date>Wed Apr 23 14:55:19 CEST 2008</swrc:date><swrc:journal>Computational Statistics \&amp; Data Analysis</swrc:journal><swrc:month>Aug</swrc:month><swrc:number>12</swrc:number><swrc:pages>6565--6581</swrc:pages><swrc:title>Testing the link when the index is semiparametric--a comparative study</swrc:title><swrc:volume>51</swrc:volume><swrc:year>2007</swrc:year><swrc:keywords>Testing the link </swrc:keywords><swrc:day>15</swrc:day><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Javier Roca-Pardi{\~n}as"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Stefan Sperlich"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/217a37ee6d746c6e9da1eec01b234946b/smicha"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/217a37ee6d746c6e9da1eec01b234946b/smicha"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/B6V84-4F490KD-4/2/a516f0d28c7f9a57c7f25a4f79ab9cec"/><swrc:date>Mon Apr 21 22:09:52 CEST 2008</swrc:date><swrc:journal>Economics Letters</swrc:journal><swrc:month>Apr</swrc:month><swrc:number>1</swrc:number><swrc:pages>95--101</swrc:pages><swrc:title>Reciprocity, matching and conditional cooperation in two public goods games</swrc:title><swrc:volume>87</swrc:volume><swrc:year>2005</swrc:year><swrc:keywords>Weakest link mechanism </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Rachel Croson"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Enrique Fatas"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Tibor Neugebauer"/></rdf:_3></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2bb86aec4dcb6d1d3b5976d7ca8e329ac/mkroell"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2bb86aec4dcb6d1d3b5976d7ca8e329ac/mkroell"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/conf/ijcai/ijcai2001.html#NgZJ01"/><swrc:date>Fri Apr 18 11:45:18 CEST 2008</swrc:date><swrc:booktitle>IJCAI</swrc:booktitle><swrc:crossref>conf/ijcai/2001</swrc:crossref><swrc:pages>903-910</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Morgan Kaufmann"/></swrc:publisher><swrc:title>Link Analysis, Eigenvectors and Stability.</swrc:title><swrc:year>2001</swrc:year><swrc:keywords>link-analysis link eigenvectors eigenvalues </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="1-55860-777-3" swrc:key="isbn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="2003-05-23" swrc:key="date"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Andrew Y. Ng"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Alice X. Zheng"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Michael I. Jordan"/></rdf:_3></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="Bernhard Nebel"/></rdf:_1></rdf:Seq></swrc:editor></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2e7eeff0c0f55509bc7b97404b4b1b876/griesbau"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2e7eeff0c0f55509bc7b97404b4b1b876/griesbau"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Book"/><swrc:date>Thu Mar 27 19:22:41 CET 2008</swrc:date><swrc:publisher><swrc:Organization swrc:name="Springer"/></swrc:publisher><swrc:title>Search Engines, Link Analysis, and User&#039;s Web Behavior</swrc:title><swrc:year>2008</swrc:year><swrc:keywords>engines Information Link retrieval user behavior analysis search </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Abraham Kandel"/></rdf:_1><rdf:_2><swrc:Person swrc:name="George Meghabghab"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/21fe2a8a26e5840d04fa9cac989b5a097/ontoman"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/21fe2a8a26e5840d04fa9cac989b5a097/ontoman"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><swrc:date>Mon Nov 12 10:42:39 CET 2007</swrc:date><swrc:booktitle>Proceedings of the Workshop on Finding Experts on the Web with Semantics (FEWS2007) at ISWC/ASWC2007, Busan, South Korea</swrc:booktitle><swrc:crossref>http://data.semanticweb.org/workshop/fews/2007/proceedings</swrc:crossref><swrc:month>November</swrc:month><swrc:title>Finding Experts by Link Prediction in Co-authorship Networks</swrc:title><swrc:year>2007</swrc:year><swrc:keywords>Networks finding Link expert link authorship </swrc:keywords><swrc:abstract>Research collaborations are always encouraged, as they often yield good results. However, the researcher network contains massive amounts of experts in various disciplines and it is difficult for the individual researcher to decide which experts will match his own expertise best. As a result, collaboration outcomes are often uncertain and research teams are poorly organized. We propose a method for building link predictors in networks, where nodes can represent researchers and links - collaborations. In this case, predictors might offer good suggestions for future collaborations. We test our method on a researcher co-authorship network and obtain link predictors of encouraging accuracy. This leads us to believe our method could be useful in building and maintaining strong research teams. It could also help with choosing vocabulary for expert description, since link predictors contain implicit information about which structural attributes of the network are important with respect to the link prediction problem.</swrc:abstract><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Milen Pavlov"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Ryutaro Ichise"/></rdf:_2></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="Anna V. Zhdanova"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Lyndon J B Nixon"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Malgorzata Mochol"/></rdf:_3><rdf:_4><swrc:Person swrc:name="John Breslin"/></rdf:_4></rdf:Seq></swrc:editor></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/21fe2a8a26e5840d04fa9cac989b5a097/iswc2007"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/21fe2a8a26e5840d04fa9cac989b5a097/iswc2007"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><swrc:date>Wed Nov 07 19:17:54 CET 2007</swrc:date><swrc:booktitle>Proceedings of the Workshop on Finding Experts on the Web with Semantics (FEWS2007) at ISWC/ASWC2007, Busan, South Korea</swrc:booktitle><swrc:crossref>http://data.semanticweb.org/workshop/fews/2007/proceedings</swrc:crossref><swrc:month>November</swrc:month><swrc:title>Finding Experts by Link Prediction in Co-authorship Networks</swrc:title><swrc:year>2007</swrc:year><swrc:keywords>2007 iswc finding expert prediction network workshop_fews link </swrc:keywords><swrc:abstract>Research collaborations are always encouraged, as they often yield good results. However, the researcher network contains massive amounts of experts in various disciplines and it is difficult for the individual researcher to decide which experts will match his own expertise best. As a result, collaboration outcomes are often uncertain and research teams are poorly organized. We propose a method for building link predictors in networks, where nodes can represent researchers and links - collaborations. In this case, predictors might offer good suggestions for future collaborations. We test our method on a researcher co-authorship network and obtain link predictors of encouraging accuracy. This leads us to believe our method could be useful in building and maintaining strong research teams. It could also help with choosing vocabulary for expert description, since link predictors contain implicit information about which structural attributes of the network are important with respect to the link prediction problem.</swrc:abstract><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Milen Pavlov"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Ryutaro Ichise"/></rdf:_2></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="Anna V. Zhdanova"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Lyndon J B Nixon"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Malgorzata Mochol"/></rdf:_3><rdf:_4><swrc:Person swrc:name="John Breslin"/></rdf:_4></rdf:Seq></swrc:editor></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/289a23b31a476c4f3f771b5e3e4a8432c/bsmyth"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/289a23b31a476c4f3f771b5e3e4a8432c/bsmyth"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><swrc:date>Sat Nov 03 00:18:07 CET 2007</swrc:date><swrc:address>New York, NY, USA</swrc:address><swrc:journal>SIGKDD Explor. Newsl.</swrc:journal><swrc:number>2</swrc:number><swrc:pages>23--30</swrc:pages><swrc:publisher><swrc:Organization swrc:name="ACM Press"/></swrc:publisher><swrc:title>Prediction and ranking algorithms for event-based network data</swrc:title><swrc:volume>7</swrc:volume><swrc:year>2005</swrc:year><swrc:keywords>link sna mining temporal </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="1931-0145" swrc:key="issn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="http://doi.acm.org/10.1145/1117454.1117458" swrc:key="doi"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Joshua O&#039;Madadhain"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Jon Hutchins"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Padhraic Smyth"/></rdf:_3></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/24ae90bacefb2df99d3003257d6eca8ca/wnpxrz"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/24ae90bacefb2df99d3003257d6eca8ca/wnpxrz"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://www.cs.umd.edu/~getoor/Publications/linkKDD04.pdf"/><swrc:date>Wed Aug 15 12:04:46 CEST 2007</swrc:date><swrc:address>Seattle, WA</swrc:address><swrc:booktitle>KDD Workshop on Link Analysis and Group Detection</swrc:booktitle><swrc:month>August</swrc:month><swrc:title>Deduplication and Group Detection using Links</swrc:title><swrc:year>2004</swrc:year><swrc:keywords>group link </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="344957" swrc:key="id"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="0" swrc:key="priority"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Indrajit Bhattacharya"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Lise Getoor"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2ec406c66aec88652cc15438fd53e140f/wnpxrz"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2ec406c66aec88652cc15438fd53e140f/wnpxrz"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://ai.stanford.edu/~erans/publications/ijcai01-ws.pdf"/><swrc:date>Wed Aug 15 12:04:30 CEST 2007</swrc:date><swrc:address>Seattle, WA</swrc:address><swrc:booktitle>IJCAI Workshop on &#034;Text Learning: Beyond Supervision&#034;</swrc:booktitle><swrc:month>August</swrc:month><swrc:title>Probabilistic Models of Text and Link Structure for Hypertext Classification</swrc:title><swrc:year>2001</swrc:year><swrc:keywords>ml hypertext link classification learning probabilistic </swrc:keywords><swrc:abstract>Most text classification methods treat each document as an
independent instance. However, in many text domains, documents
are linked and the topics of linked documents are correlated.
For example, web pages of related topics are often
connected by hyperlinks and scientific papers from related
fields are commonly linked by citations. We propose a
unified probabilistic model for both the textual content and
the link structure of a document collection. Our model is
based on the recently introduced framework of Probabilistic
Relational Models (PRMs), which allows us to capture correlations
between linked documents. We show how to learn
these models from data and use them efficiently for classification.
Since exact methods for classification in these large
models are intractable, we utilize belief propagation, an approximate
inference algorithm. Belief propagation automatically
induces a very natural behavior, where our knowledge
about one document helps us classify related ones, which in
turn help us classify others. We present preliminary empirical
results on a dataset of university web pages.</swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="344951" swrc:key="id"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="0" swrc:key="priority"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Lise Getoor"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Eran Segal"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Ben Taskar"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Daphne Koller"/></rdf:_4></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/28a63e3d953c940011363eb9307a4106f/wnpxrz"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/28a63e3d953c940011363eb9307a4106f/wnpxrz"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://portal.acm.org/citation.cfm?id=944950"/><swrc:date>Wed Aug 15 12:04:07 CEST 2007</swrc:date><swrc:address>Cambridge, MA, USA</swrc:address><swrc:journal>Journal of Machine Learning Research</swrc:journal><swrc:month>December</swrc:month><swrc:pages>679--707</swrc:pages><swrc:publisher><swrc:Organization swrc:name="MIT Press"/></swrc:publisher><swrc:title>Learning probabilistic models of link structure</swrc:title><swrc:volume>3</swrc:volume><swrc:year>2002</swrc:year><swrc:keywords>link learning ml probabilistic </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="344949" swrc:key="id"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="1533-7928" swrc:key="issn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="0" swrc:key="priority"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="Main.ThomasHofmannCiteSeer" swrc:key="comment"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Lisa Getoor"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Nir Friedman"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Daphne Koller"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Benjamin Taskar"/></rdf:_4></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/26b0aee01f679c2e3a908de72d4ee8a9b/arath"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/26b0aee01f679c2e3a908de72d4ee8a9b/arath"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Misc"/><owl:sameAs rdf:resource="/brokenurl#citeseer.ist.psu.edu/zaki02efficiently.html"/><swrc:date>Sat Jul 14 10:58:22 CEST 2007</swrc:date><swrc:month>July</swrc:month><swrc:note>In KDD&#039;02</swrc:note><swrc:title>Efficiently mining frequent trees in a forest</swrc:title><swrc:year>2002</swrc:year><swrc:keywords>mining link </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="M. Zaki"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2e2b358a5c3b94db1cc5dfa7dcf5bb342/arath"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2e2b358a5c3b94db1cc5dfa7dcf5bb342/arath"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><swrc:date>Sat Jul 14 10:58:22 CEST 2007</swrc:date><swrc:journal>SIGKDD Explorations</swrc:journal><swrc:number>2</swrc:number><swrc:pages>76-83</swrc:pages><swrc:title>Link mining applications: progress and challenges.</swrc:title><swrc:volume>7</swrc:volume><swrc:year>2005</swrc:year><swrc:keywords>link mining </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://doi.acm.org/10.1145/1117454.1117465" swrc:key="ee"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="DBLP, http://dblp.uni-trier.de" swrc:key="bibsource"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Ted E. Senator"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2ac02f1d7dea7a106bc4103c8a9ec4aef/arath"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2ac02f1d7dea7a106bc4103c8a9ec4aef/arath"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><swrc:date>Sat Jul 14 10:58:22 CEST 2007</swrc:date><swrc:address>New York, NY, USA</swrc:address><swrc:journal>SIGKDD Explor. Newsl.</swrc:journal><swrc:number>2</swrc:number><swrc:pages>3--12</swrc:pages><swrc:publisher><swrc:Organization swrc:name="ACM Press"/></swrc:publisher><swrc:title>Link mining: a survey</swrc:title><swrc:volume>7</swrc:volume><swrc:year>2005</swrc:year><swrc:keywords>mining link </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="1931-0145" swrc:key="issn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="http://doi.acm.org/10.1145/1117454.1117456" swrc:key="doi"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Lise Getoor"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Christopher P. Diehl"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/25c6989390560940fb892e869d42f5ffb/arath"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/25c6989390560940fb892e869d42f5ffb/arath"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><swrc:date>Sat Jul 14 10:58:22 CEST 2007</swrc:date><swrc:address>New York, NY, USA</swrc:address><swrc:journal>SIGKDD Explor. Newsl.</swrc:journal><swrc:number>1</swrc:number><swrc:pages>84--89</swrc:pages><swrc:publisher><swrc:Organization swrc:name="ACM Press"/></swrc:publisher><swrc:title>Link mining: a new data mining challenge</swrc:title><swrc:volume>5</swrc:volume><swrc:year>2003</swrc:year><swrc:keywords>link mining </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="1931-0145" swrc:key="issn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="http://doi.acm.org/10.1145/959242.959253" swrc:key="doi"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="L. Getoor"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description><foaf:Group rdf:about="http://www.bibsonomy.org/tag/link"><foaf:name>link</foaf:name><description>Community for tag(s) link</description></foaf:Group></rdf:RDF>