<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE rdf:RDF [
 <!ENTITY rdf 'http://www.w3.org/1999/02/22-rdf-syntax-ns#'>
 <!ENTITY rdfs 'http://www.w3.org/2000/01/rdf-schema#'>

 <!ENTITY swrc 'http://swrc.ontoware.org/ontology#'>
 <!ENTITY xsd 'http://www.w3.org/2001/XMLSchema#'>
]>

<rdf:RDF
 xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
 xmlns="http://purl.org/rss/1.0/"
 xmlns:cc="http://web.resource.org/cc/"
 xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/"
 xmlns:dc="http://purl.org/dc/elements/1.1/"
 xmlns:syn="http://purl.org/rss/1.0/modules/syndication/"
 xmlns:content="http://purl.org/rss/1.0/modules/content/"
 xmlns:admin="http://webns.net/mvcb/"
 xmlns:burst="http://xmlns.com/burst/0.1/"
 
 xmlns:rdfs="&rdfs;"
 xmlns:swrc="&swrc;"
 xmlns:xsd="&xsd;"
>

<channel rdf:about="http://www.bibsonomy.org/uri/author/Badia">
  <title>BibSonomy publications for /author/Badia</title>
  <link>http://www.bibsonomy.org/burst/author/Badia</link>
  <description>BibSonomy BuRST Feed for /author/Badia</description>
  <dc:date>2008-07-27T02:24:42+02:00</dc:date>

  <items>
    <rdf:Seq>
      <rdf:li rdf:resource="http://www.bibsonomy.org/uri/bibtex/2adce68801f188742f7b1a7e56df327e2/dblp"/>
      <rdf:li rdf:resource="http://www.bibsonomy.org/uri/bibtex/253fb57b6c54debd70ee873751acfcf15/mkroell"/>
      <rdf:li rdf:resource="http://www.bibsonomy.org/uri/bibtex/253fb57b6c54debd70ee873751acfcf15/maida"/>
      <rdf:li rdf:resource="http://www.bibsonomy.org/uri/bibtex/2984813cf4918ddb56e0e6e6d39367941/dblp"/>
      <rdf:li rdf:resource="http://www.bibsonomy.org/uri/bibtex/249f9e7dbb05c45941283f8e53b06a93e/dblp"/>
      <rdf:li rdf:resource="http://www.bibsonomy.org/uri/bibtex/253fb57b6c54debd70ee873751acfcf15/mschuber"/>
      <rdf:li rdf:resource="http://www.bibsonomy.org/uri/bibtex/2bd8102dd61514c0c568eb5ee4c994703/dblp"/>
      <rdf:li rdf:resource="http://www.bibsonomy.org/uri/bibtex/29504f8179950cb022a08429e501f8ff7/pflanzenern"/>
      <rdf:li rdf:resource="http://www.bibsonomy.org/uri/bibtex/253fb57b6c54debd70ee873751acfcf15/chriskoerner"/>
      <rdf:li rdf:resource="http://www.bibsonomy.org/uri/bibtex/2f1dc5bb35f202f7b7d4653afa9c96035/mstrohm"/>
      </rdf:Seq>
  </items>
</channel>

<item rdf:about="http://www.bibsonomy.org/uri/bibtex/2adce68801f188742f7b1a7e56df327e2/dblp">
    <title>Performance of computationally intensive parameter sweep applications on Internet-based Grids of computers: the mapping of molecular potential energy hypersurfaces.</title>
    <description>dblp</description><link>http://www.bibsonomy.org/bibtex/2adce68801f188742f7b1a7e56df327e2/dblp</link>
    <dc:creator>dblp</dc:creator>
    <dc:date>2008-07-07T00:00:00+02:00</dc:date>
    <dc:subject>dblp </dc:subject>
    <content:encoded>
	    <![CDATA[
        <div class="block">
	      <div class="bmtitle">

  <a href="http://www.bibsonomy.org/bibtex/2adce68801f188742f7b1a7e56df327e2/dblp">Performance of computationally intensive parameter sweep applications on Internet-based Grids of computers: the mapping of molecular potential energy hypersurfaces.</a>
</div>
<div class="bmdesc">
  <span style="color:#555555;"> 
    Sebastián <a href="http://www.bibsonomy.org/author/Reyes">Reyes</a>         	     	 
        	  and Camelia <a href="http://www.bibsonomy.org/author/Mu%C3%B1oz-Caro">Muñoz-Caro</a>         	     	 
        	  and Alfonso <a href="http://www.bibsonomy.org/author/Ni%C3%B1o">Niño</a>         	     	 
        	  and Rosa M. <a href="http://www.bibsonomy.org/author/Badia">Badia</a>         	     	 
        	  and José M. <a href="http://www.bibsonomy.org/author/Cela">Cela</a>         	     	 
        	 </span> 
  <em>Concurrency and Computation: Practice and Experience</em>
      <b>19</b>
      463-481
  (2007)
</div>
<span class="bmmeta">
  
  
        to
        <span class="bmtags">
        <a href="http://www.bibsonomy.org/user/dblp/dblp">dblp</a>
        </span>
        

          by <a href="http://www.bibsonomy.org/user/dblp">dblp</a> 
        
        
        on 2008-07-07 00:00:00 </span></div>
	    ]]>
    </content:encoded>
    <taxo:topics>
      <rdf:Bag>
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp" />
        </rdf:Bag>
    </taxo:topics>
    <burst:publication>
      <swrc:Article>
        <swrc:journal>Concurrency and Computation: Practice and Experience</swrc:journal><swrc:number>4</swrc:number><swrc:pages>463-481</swrc:pages><swrc:title>Performance of computationally intensive parameter sweep applications on Internet-based Grids of computers: the mapping of molecular potential energy hypersurfaces.</swrc:title><swrc:volume>19</swrc:volume><swrc:year>2007</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:date>2008-07-07 00:00:00.0</swrc:date><swrc:hasExtraField>
    <swrc:Field swrc:key="ee" swrc:value="http://dx.doi.org/10.1002/cpe.1114"/>
  </swrc:hasExtraField>
<swrc:hasExtraField>
    <swrc:Field swrc:key="date" swrc:value="2008-07-07"/>
  </swrc:hasExtraField>
<swrc:author>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Sebastián Reyes" /></rdf:_1>
  <rdf:_2><swrc:Person swrc:name="Camelia Muñoz-Caro" /></rdf:_2>
  <rdf:_3><swrc:Person swrc:name="Alfonso Niño" /></rdf:_3>
  <rdf:_4><swrc:Person swrc:name="Rosa M. Badia" /></rdf:_4>
  <rdf:_5><swrc:Person swrc:name="José M. Cela" /></rdf:_5>
  </rdf:Seq>
</swrc:author>

<swrc:editor>
  <rdf:Seq>
  </rdf:Seq>
</swrc:editor></swrc:Article>  
    </burst:publication>
  </item>
<item rdf:about="http://www.bibsonomy.org/uri/bibtex/253fb57b6c54debd70ee873751acfcf15/mkroell">
    <title>Graph building as a mining activity: finding links in the small</title>
    <description>Graph building as a mining activity</description><link>http://www.bibsonomy.org/bibtex/253fb57b6c54debd70ee873751acfcf15/mkroell</link>
    <dc:creator>mkroell</dc:creator>
    <dc:date>2008-06-25T20:40:17+02:00</dc:date>
    <dc:subject>SNA framework graph mining networks toread </dc:subject>
    <content:encoded>
	    <![CDATA[
        <div class="block">
	      <div class="bmtitle">

  <a href="http://www.bibsonomy.org/bibtex/253fb57b6c54debd70ee873751acfcf15/mkroell">Graph building as a mining activity: finding links in the small</a>
</div>
<div class="bmdesc">
  <span style="color:#555555;"> 
    Antonio <a href="http://www.bibsonomy.org/author/Badia">Badia</a>         	     	 
        	  and Mehmed <a href="http://www.bibsonomy.org/author/Kantardzic">Kantardzic</a>         	     	 
        	 </span> 
  <em>LinkKDD '05: Proceedings of the 3rd international workshop on Link discovery</em>
    17--24
  (2005)
</div>
<span class="bmmeta">
  
  
        to
        <span class="bmtags">
        <a href="http://www.bibsonomy.org/user/mkroell/SNA">SNA</a>
        <a href="http://www.bibsonomy.org/user/mkroell/framework">framework</a>
        <a href="http://www.bibsonomy.org/user/mkroell/graph">graph</a>
        <a href="http://www.bibsonomy.org/user/mkroell/mining">mining</a>
        <a href="http://www.bibsonomy.org/user/mkroell/networks">networks</a>
        <a href="http://www.bibsonomy.org/user/mkroell/toread">toread</a>
        </span>
        

          by <a href="http://www.bibsonomy.org/user/mkroell">mkroell</a> 
        
        
        on 2008-06-25 20:40:17 </span></div>
	    ]]>
    </content:encoded>
    <taxo:topics>
      <rdf:Bag>
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/SNA" />
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/framework" />
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/graph" />
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/mining" />
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/networks" />
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/toread" />
        </rdf:Bag>
    </taxo:topics>
    <burst:publication>
      <swrc:InProceedings>
        <swrc:address>New York, NY, USA</swrc:address><swrc:booktitle>LinkKDD &#039;05: Proceedings of the 3rd international workshop on Link discovery</swrc:booktitle><swrc:pages>17--24</swrc:pages><swrc:publisher><swrc:Organization swrc:name="ACM"/></swrc:publisher><swrc:title>Graph building as a mining activity: finding links in the small</swrc:title><swrc:year>2005</swrc:year><swrc:keywords>SNA framework graph mining networks toread </swrc:keywords><swrc:date>2008-06-25 20:40:17.0</swrc:date><swrc:abstract>Many analysis of data proceed by building a graph out of the data set and then using social network theory and similar tools on the result. However, there is no theory concerning the construction of the graph itself, even though this is a very important process. In this paper, we attempt to provide a framework in which the graph building process is formalized and studied. We show the parameters (choices) involved in constructing a graph from raw data, and propose some new ways to combine and analyze the data. We also argue the importance of this approach in several domain applications, including criminal/terrorist investigations.</swrc:abstract><swrc:hasExtraField>
    <swrc:Field swrc:key="location" swrc:value="Chicago, Illinois"/>
  </swrc:hasExtraField>
<swrc:hasExtraField>
    <swrc:Field swrc:key="isbn" swrc:value="1-59593-215-1"/>
  </swrc:hasExtraField>
<swrc:hasExtraField>
    <swrc:Field swrc:key="doi" swrc:value="http://doi.acm.org/10.1145/1134271.1134274"/>
  </swrc:hasExtraField>
<swrc:author>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Antonio Badia" /></rdf:_1>
  <rdf:_2><swrc:Person swrc:name="Mehmed Kantardzic" /></rdf:_2>
  </rdf:Seq>
</swrc:author>

<swrc:editor>
  <rdf:Seq>
  </rdf:Seq>
</swrc:editor></swrc:InProceedings>  
    </burst:publication>
  </item>
<item rdf:about="http://www.bibsonomy.org/uri/bibtex/253fb57b6c54debd70ee873751acfcf15/maida">
    <title>Graph building as a mining activity: finding links in the small</title>
    <description>Graph building as a mining activity</description><link>http://www.bibsonomy.org/bibtex/253fb57b6c54debd70ee873751acfcf15/maida</link>
    <dc:creator>maida</dc:creator>
    <dc:date>2008-06-25T16:32:39+02:00</dc:date>
    <dc:subject>imported </dc:subject>
    <content:encoded>
	    <![CDATA[
        <div class="block">
	      <div class="bmtitle">

  <a href="http://www.bibsonomy.org/bibtex/253fb57b6c54debd70ee873751acfcf15/maida">Graph building as a mining activity: finding links in the small</a>
</div>
<div class="bmdesc">
  <span style="color:#555555;"> 
    Antonio <a href="http://www.bibsonomy.org/author/Badia">Badia</a>         	     	 
        	  and Mehmed <a href="http://www.bibsonomy.org/author/Kantardzic">Kantardzic</a>         	     	 
        	 </span> 
  <em>LinkKDD '05: Proceedings of the 3rd international workshop on Link discovery</em>
    17--24
  (2005)
</div>
<span class="bmmeta">
  
  
        to
        <span class="bmtags">
        <a href="http://www.bibsonomy.org/user/maida/imported">imported</a>
        </span>
        

          by <a href="http://www.bibsonomy.org/user/maida">maida</a> 
        
        
        on 2008-06-25 16:32:39 </span></div>
	    ]]>
    </content:encoded>
    <taxo:topics>
      <rdf:Bag>
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/imported" />
        </rdf:Bag>
    </taxo:topics>
    <burst:publication>
      <swrc:InProceedings>
        <swrc:address>New York, NY, USA</swrc:address><swrc:booktitle>LinkKDD &#039;05: Proceedings of the 3rd international workshop on Link discovery</swrc:booktitle><swrc:pages>17--24</swrc:pages><swrc:publisher><swrc:Organization swrc:name="ACM"/></swrc:publisher><swrc:title>Graph building as a mining activity: finding links in the small</swrc:title><swrc:year>2005</swrc:year><swrc:keywords>imported </swrc:keywords><swrc:date>2008-06-25 16:32:39.0</swrc:date><swrc:abstract>Many analysis of data proceed by building a graph out of the data set and then using social network theory and similar tools on the result. However, there is no theory concerning the construction of the graph itself, even though this is a very important process. In this paper, we attempt to provide a framework in which the graph building process is formalized and studied. We show the parameters (choices) involved in constructing a graph from raw data, and propose some new ways to combine and analyze the data. We also argue the importance of this approach in several domain applications, including criminal/terrorist investigations.</swrc:abstract><swrc:hasExtraField>
    <swrc:Field swrc:key="location" swrc:value="Chicago, Illinois"/>
  </swrc:hasExtraField>
<swrc:hasExtraField>
    <swrc:Field swrc:key="isbn" swrc:value="1-59593-215-1"/>
  </swrc:hasExtraField>
<swrc:hasExtraField>
    <swrc:Field swrc:key="doi" swrc:value="http://doi.acm.org/10.1145/1134271.1134274"/>
  </swrc:hasExtraField>
<swrc:author>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Antonio Badia" /></rdf:_1>
  <rdf:_2><swrc:Person swrc:name="Mehmed Kantardzic" /></rdf:_2>
  </rdf:Seq>
</swrc:author>

<swrc:editor>
  <rdf:Seq>
  </rdf:Seq>
</swrc:editor></swrc:InProceedings>  
    </burst:publication>
  </item>
<item rdf:about="http://www.bibsonomy.org/uri/bibtex/2984813cf4918ddb56e0e6e6d39367941/dblp">
    <title>Evaluation de la maquette d'un service multimodal de recherche d'itin&#233;raire dans un r&#233;seau de bus.</title>
    <description>dblp</description><link>http://www.bibsonomy.org/bibtex/2984813cf4918ddb56e0e6e6d39367941/dblp</link>
    <dc:creator>dblp</dc:creator>
    <dc:date>2008-06-17T00:00:00+02:00</dc:date>
    <dc:subject>dblp </dc:subject>
    <content:encoded>
	    <![CDATA[
        <div class="block">
	      <div class="bmtitle">

  <a href="http://www.bibsonomy.org/bibtex/2984813cf4918ddb56e0e6e6d39367941/dblp">Evaluation de la maquette d'un service multimodal de recherche d'itin&#233;raire dans un r&#233;seau de bus.</a>
</div>
<div class="bmdesc">
  <span style="color:#555555;"> 
    Marc <a href="http://www.bibsonomy.org/author/Mersiol">Mersiol</a>         	     	 
        	  and Fanny <a href="http://www.bibsonomy.org/author/Badia">Badia</a>         	     	 
        	 </span> 
  <em>IHM</em>
    241-244
  (2006)
</div>
<span class="bmmeta">
  
  
        to
        <span class="bmtags">
        <a href="http://www.bibsonomy.org/user/dblp/dblp">dblp</a>
        </span>
        

          by <a href="http://www.bibsonomy.org/user/dblp">dblp</a> 
        
        
        on 2008-06-17 00:00:00 </span></div>
	    ]]>
    </content:encoded>
    <taxo:topics>
      <rdf:Bag>
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp" />
        </rdf:Bag>
    </taxo:topics>
    <burst:publication>
      <swrc:InProceedings>
        <swrc:booktitle>IHM</swrc:booktitle><swrc:crossref>conf/ihm/2006</swrc:crossref><swrc:pages>241-244</swrc:pages><swrc:publisher><swrc:Organization swrc:name="ACM"/></swrc:publisher><swrc:series>ACM International Conference Proceeding Series</swrc:series><swrc:title>Evaluation de la maquette d&#039;un service multimodal de recherche d&#039;itinéraire dans un réseau de bus.</swrc:title><swrc:volume>133</swrc:volume><swrc:year>2006</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:date>2008-06-17 00:00:00.0</swrc:date><swrc:hasExtraField>
    <swrc:Field swrc:key="ee" swrc:value="http://doi.acm.org/10.1145/1132736.1132775"/>
  </swrc:hasExtraField>
<swrc:hasExtraField>
    <swrc:Field swrc:key="isbn" swrc:value="1-59593-350-6"/>
  </swrc:hasExtraField>
<swrc:hasExtraField>
    <swrc:Field swrc:key="date" swrc:value="2008-06-17"/>
  </swrc:hasExtraField>
<swrc:author>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Marc Mersiol" /></rdf:_1>
  <rdf:_2><swrc:Person swrc:name="Fanny Badia" /></rdf:_2>
  </rdf:Seq>
</swrc:author>

<swrc:editor>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Jean-Marc Robert" /></rdf:_1>
  <rdf:_2><swrc:Person swrc:name="Bertrand David" /></rdf:_2>
  </rdf:Seq>
</swrc:editor></swrc:InProceedings>  
    </burst:publication>
  </item>
<item rdf:about="http://www.bibsonomy.org/uri/bibtex/249f9e7dbb05c45941283f8e53b06a93e/dblp">
    <title>Automatic analysis of speedup of MPI applications.</title>
    <description>dblp</description><link>http://www.bibsonomy.org/bibtex/249f9e7dbb05c45941283f8e53b06a93e/dblp</link>
    <dc:creator>dblp</dc:creator>
    <dc:date>2008-06-16T00:00:00+02:00</dc:date>
    <dc:subject>dblp </dc:subject>
    <content:encoded>
	    <![CDATA[
        <div class="block">
	      <div class="bmtitle">

  <a href="http://www.bibsonomy.org/bibtex/249f9e7dbb05c45941283f8e53b06a93e/dblp">Automatic analysis of speedup of MPI applications.</a>
</div>
<div class="bmdesc">
  <span style="color:#555555;"> 
    Marc <a href="http://www.bibsonomy.org/author/Casas">Casas</a>         	     	 
        	  and Rosa M. <a href="http://www.bibsonomy.org/author/Badia">Badia</a>         	     	 
        	  and Jesús <a href="http://www.bibsonomy.org/author/Labarta">Labarta</a>         	     	 
        	 </span> 
  <em>ICS</em>
    349-358
  (2008)
</div>
<span class="bmmeta">
  
  
        to
        <span class="bmtags">
        <a href="http://www.bibsonomy.org/user/dblp/dblp">dblp</a>
        </span>
        

          by <a href="http://www.bibsonomy.org/user/dblp">dblp</a> 
        
        
        on 2008-06-16 00:00:00 </span></div>
	    ]]>
    </content:encoded>
    <taxo:topics>
      <rdf:Bag>
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp" />
        </rdf:Bag>
    </taxo:topics>
    <burst:publication>
      <swrc:InProceedings>
        <swrc:booktitle>ICS</swrc:booktitle><swrc:crossref>conf/ics/2008</swrc:crossref><swrc:pages>349-358</swrc:pages><swrc:publisher><swrc:Organization swrc:name="ACM"/></swrc:publisher><swrc:title>Automatic analysis of speedup of MPI applications.</swrc:title><swrc:year>2008</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:date>2008-06-16 00:00:00.0</swrc:date><swrc:hasExtraField>
    <swrc:Field swrc:key="ee" swrc:value="http://doi.acm.org/10.1145/1375527.1375578"/>
  </swrc:hasExtraField>
<swrc:hasExtraField>
    <swrc:Field swrc:key="isbn" swrc:value="978-1-60558-158-3"/>
  </swrc:hasExtraField>
<swrc:hasExtraField>
    <swrc:Field swrc:key="date" swrc:value="2008-06-16"/>
  </swrc:hasExtraField>
<swrc:author>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Marc Casas" /></rdf:_1>
  <rdf:_2><swrc:Person swrc:name="Rosa M. Badia" /></rdf:_2>
  <rdf:_3><swrc:Person swrc:name="Jesús Labarta" /></rdf:_3>
  </rdf:Seq>
</swrc:author>

<swrc:editor>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Pin Zhou" /></rdf:_1>
  </rdf:Seq>
</swrc:editor></swrc:InProceedings>  
    </burst:publication>
  </item>
<item rdf:about="http://www.bibsonomy.org/uri/bibtex/253fb57b6c54debd70ee873751acfcf15/mschuber">
    <title>Graph building as a mining activity: finding links in the small</title>
    <link>http://www.bibsonomy.org/bibtex/253fb57b6c54debd70ee873751acfcf15/mschuber</link>
    <dc:creator>mschuber</dc:creator>
    <dc:date>2008-05-27T10:07:44+02:00</dc:date>
    <dc:subject>RG-done analysis framework graph link-analysis mining networks similiarity </dc:subject>
    <content:encoded>
	    <![CDATA[
        <div class="block">
	      <div class="bmtitle">

  <a href="http://www.bibsonomy.org/bibtex/253fb57b6c54debd70ee873751acfcf15/mschuber">Graph building as a mining activity: finding links in the small</a>
</div>
<div class="bmdesc">
  <span style="color:#555555;"> 
    Antonio <a href="http://www.bibsonomy.org/author/Badia">Badia</a>         	     	 
        	  and Mehmed <a href="http://www.bibsonomy.org/author/Kantardzic">Kantardzic</a>         	     	 
        	 </span> 
  <em>LinkKDD '05: Proceedings of the 3rd international workshop on Link discovery</em>
    17--24
  (2005)
</div>
<span class="bmmeta">
  
  
        to
        <span class="bmtags">
        <a href="http://www.bibsonomy.org/user/mschuber/RG-done">RG-done</a>
        <a href="http://www.bibsonomy.org/user/mschuber/analysis">analysis</a>
        <a href="http://www.bibsonomy.org/user/mschuber/framework">framework</a>
        <a href="http://www.bibsonomy.org/user/mschuber/graph">graph</a>
        <a href="http://www.bibsonomy.org/user/mschuber/link-analysis">link-analysis</a>
        <a href="http://www.bibsonomy.org/user/mschuber/mining">mining</a>
        <a href="http://www.bibsonomy.org/user/mschuber/networks">networks</a>
        <a href="http://www.bibsonomy.org/user/mschuber/similiarity">similiarity</a>
        </span>
        

          by <a href="http://www.bibsonomy.org/user/mschuber">mschuber</a> 
        
        
        on 2008-05-27 10:07:44 </span></div>
	    ]]>
    </content:encoded>
    <taxo:topics>
      <rdf:Bag>
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/RG-done" />
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/analysis" />
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/framework" />
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/graph" />
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/link-analysis" />
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/mining" />
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/networks" />
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/similiarity" />
        </rdf:Bag>
    </taxo:topics>
    <burst:publication>
      <swrc:InProceedings>
        <swrc:address>New York, NY, USA</swrc:address><swrc:booktitle>LinkKDD &#039;05: Proceedings of the 3rd international workshop on Link discovery</swrc:booktitle><swrc:pages>17--24</swrc:pages><swrc:publisher><swrc:Organization swrc:name="ACM"/></swrc:publisher><swrc:title>Graph building as a mining activity: finding links in the small</swrc:title><swrc:year>2005</swrc:year><swrc:keywords>RG-done analysis framework graph link-analysis mining networks similiarity </swrc:keywords><swrc:date>2008-05-27 10:07:44.0</swrc:date><swrc:abstract>Many analysis of data proceed by building a graph out of
the data set and then using social network theory and similar
tools on the result. However, there is no theory concerning
the construction of the graph itself, even though this is a
very important process. In this paper, we attempt to pro-
vide a framework in which the graph building process is
formalized and studied. We show the parameters (choices)
involved in constructing a graph from raw data, and pro-
pose some new ways to combine and analyze the data. We
also argue the importance of this approach in several domain
applications, including criminal/terrorist investigations.</swrc:abstract><swrc:author>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Antonio Badia" /></rdf:_1>
  <rdf:_2><swrc:Person swrc:name="Mehmed Kantardzic" /></rdf:_2>
  </rdf:Seq>
</swrc:author>

<swrc:editor>
  <rdf:Seq>
  </rdf:Seq>
</swrc:editor></swrc:InProceedings>  
    </burst:publication>
  </item>
<item rdf:about="http://www.bibsonomy.org/uri/bibtex/2bd8102dd61514c0c568eb5ee4c994703/dblp">
    <title>COMP Superscalar: Bringing GRID Superscalar and GCM Together.</title>
    <description>dblp</description><link>http://www.bibsonomy.org/bibtex/2bd8102dd61514c0c568eb5ee4c994703/dblp</link>
    <dc:creator>dblp</dc:creator>
    <dc:date>2008-05-21T00:00:00+02:00</dc:date>
    <dc:subject>dblp </dc:subject>
    <content:encoded>
	    <![CDATA[
        <div class="block">
	      <div class="bmtitle">

  <a href="http://www.bibsonomy.org/bibtex/2bd8102dd61514c0c568eb5ee4c994703/dblp">COMP Superscalar: Bringing GRID Superscalar and GCM Together.</a>
</div>
<div class="bmdesc">
  <span style="color:#555555;"> 
    Enric <a href="http://www.bibsonomy.org/author/Tejedor">Tejedor</a>         	     	 
        	  and Rosa M. <a href="http://www.bibsonomy.org/author/Badia">Badia</a>         	     	 
        	 </span> 
  <em>CCGRID</em>
    185-193
  (2008)
</div>
<span class="bmmeta">
  
  
        to
        <span class="bmtags">
        <a href="http://www.bibsonomy.org/user/dblp/dblp">dblp</a>
        </span>
        

          by <a href="http://www.bibsonomy.org/user/dblp">dblp</a> 
        
        
        on 2008-05-21 00:00:00 </span></div>
	    ]]>
    </content:encoded>
    <taxo:topics>
      <rdf:Bag>
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp" />
        </rdf:Bag>
    </taxo:topics>
    <burst:publication>
      <swrc:InProceedings>
        <swrc:booktitle>CCGRID</swrc:booktitle><swrc:crossref>conf/ccgrid/2008</swrc:crossref><swrc:pages>185-193</swrc:pages><swrc:publisher><swrc:Organization swrc:name="IEEE Computer Society"/></swrc:publisher><swrc:title>COMP Superscalar: Bringing GRID Superscalar and GCM Together.</swrc:title><swrc:year>2008</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:date>2008-05-21 00:00:00.0</swrc:date><swrc:hasExtraField>
    <swrc:Field swrc:key="ee" swrc:value="http://doi.ieeecomputersociety.org/10.1109/CCGRID.2008.104"/>
  </swrc:hasExtraField>
<swrc:hasExtraField>
    <swrc:Field swrc:key="date" swrc:value="2008-05-21"/>
  </swrc:hasExtraField>
<swrc:author>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Enric Tejedor" /></rdf:_1>
  <rdf:_2><swrc:Person swrc:name="Rosa M. Badia" /></rdf:_2>
  </rdf:Seq>
</swrc:author>

<swrc:editor>
  <rdf:Seq>
  </rdf:Seq>
</swrc:editor></swrc:InProceedings>  
    </burst:publication>
  </item>
<item rdf:about="http://www.bibsonomy.org/uri/bibtex/29504f8179950cb022a08429e501f8ff7/pflanzenern">
    <title>Amelioration and nutrient management strategies for sodic and alkali soils.</title>
    <link>http://www.bibsonomy.org/bibtex/29504f8179950cb022a08429e501f8ff7/pflanzenern</link>
    <dc:creator>pflanzenern</dc:creator>
    <dc:date>2008-05-09T10:28:44+02:00</dc:date>
    <dc:subject>IFZ imported </dc:subject>
    <content:encoded>
	    <![CDATA[
        <div class="block">
	      <div class="bmtitle">

  <a href="http://www.bibsonomy.org/bibtex/29504f8179950cb022a08429e501f8ff7/pflanzenern">Amelioration and nutrient management strategies for sodic and alkali soils.</a>
</div>
<div class="bmdesc">
  <span style="color:#555555;"> 
    M. <a href="http://www.bibsonomy.org/author/Qadir">Qadir</a>         	     	 
        	  and S. <a href="http://www.bibsonomy.org/author/Schubert">Schubert</a>         	     	 
        	  and D. <a href="http://www.bibsonomy.org/author/Badia">Badia</a>         	     	 
        	  and B. <a href="http://www.bibsonomy.org/author/R+Sharma">R Sharma</a>         	     	 
        	  and A. <a href="http://www.bibsonomy.org/author/S+Qureshi">S Qureshi</a>         	     	 
        	  and Murtaza <a href="http://www.bibsonomy.org/author/G.">G.</a>         	     	 
        	 </span> 
  <em>Perspectives in Agriculture, Veterinary Science, Nutrition and Natural Resources</em>
      <b>2</b>
      1-13
  (2007)
</div>
<span class="bmmeta">
  
  
        to
        <span class="bmtags">
        <a href="http://www.bibsonomy.org/user/pflanzenern/IFZ">IFZ</a>
        <a href="http://www.bibsonomy.org/user/pflanzenern/imported">imported</a>
        </span>
        

          by <a href="http://www.bibsonomy.org/user/pflanzenern">pflanzenern</a> 
        
        
        on 2008-05-09 10:28:44 </span></div>
	    ]]>
    </content:encoded>
    <taxo:topics>
      <rdf:Bag>
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/IFZ" />
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/imported" />
        </rdf:Bag>
    </taxo:topics>
    <burst:publication>
      <swrc:Article>
        <swrc:journal>Perspectives in Agriculture, Veterinary Science, Nutrition and Natural Resources</swrc:journal><swrc:pages>1-13</swrc:pages><swrc:title>Amelioration and nutrient management strategies for sodic and alkali soils. </swrc:title><swrc:volume>2</swrc:volume><swrc:year>2007</swrc:year><swrc:keywords>IFZ imported </swrc:keywords><swrc:date>2008-05-09 10:28:44.0</swrc:date><swrc:author>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="M. Qadir" /></rdf:_1>
  <rdf:_2><swrc:Person swrc:name="S. Schubert" /></rdf:_2>
  <rdf:_3><swrc:Person swrc:name="D. Badia" /></rdf:_3>
  <rdf:_4><swrc:Person swrc:name="B. R Sharma" /></rdf:_4>
  <rdf:_5><swrc:Person swrc:name="A. S Qureshi" /></rdf:_5>
  <rdf:_6><swrc:Person swrc:name="Murtaza G." /></rdf:_6>
  </rdf:Seq>
</swrc:author>

<swrc:editor>
  <rdf:Seq>
  </rdf:Seq>
</swrc:editor></swrc:Article>  
    </burst:publication>
  </item>
<item rdf:about="http://www.bibsonomy.org/uri/bibtex/253fb57b6c54debd70ee873751acfcf15/chriskoerner">
    <title>Graph building as a mining activity: finding links in the small</title>
    <description>Graph building as a mining activity</description><link>http://www.bibsonomy.org/bibtex/253fb57b6c54debd70ee873751acfcf15/chriskoerner</link>
    <dc:creator>chriskoerner</dc:creator>
    <dc:date>2008-05-05T19:08:57+02:00</dc:date>
    <dc:subject>imported </dc:subject>
    <content:encoded>
	    <![CDATA[
        <div class="block">
	      <div class="bmtitle">

  <a href="http://www.bibsonomy.org/bibtex/253fb57b6c54debd70ee873751acfcf15/chriskoerner">Graph building as a mining activity: finding links in the small</a>
</div>
<div class="bmdesc">
  <span style="color:#555555;"> 
    Antonio <a href="http://www.bibsonomy.org/author/Badia">Badia</a>         	     	 
        	  and Mehmed <a href="http://www.bibsonomy.org/author/Kantardzic">Kantardzic</a>         	     	 
        	 </span> 
  <em>LinkKDD '05: Proceedings of the 3rd international workshop on Link discovery</em>
    17--24
  (2005)
</div>
<span class="bmmeta">
  
  
        to
        <span class="bmtags">
        <a href="http://www.bibsonomy.org/user/chriskoerner/imported">imported</a>
        </span>
        

          by <a href="http://www.bibsonomy.org/user/chriskoerner">chriskoerner</a> 
        
        
        on 2008-05-05 19:08:57 </span></div>
	    ]]>
    </content:encoded>
    <taxo:topics>
      <rdf:Bag>
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/imported" />
        </rdf:Bag>
    </taxo:topics>
    <burst:publication>
      <swrc:InProceedings>
        <swrc:address>New York, NY, USA</swrc:address><swrc:booktitle>LinkKDD &#039;05: Proceedings of the 3rd international workshop on Link discovery</swrc:booktitle><swrc:pages>17--24</swrc:pages><swrc:publisher><swrc:Organization swrc:name="ACM"/></swrc:publisher><swrc:title>Graph building as a mining activity: finding links in the small</swrc:title><swrc:year>2005</swrc:year><swrc:keywords>imported </swrc:keywords><swrc:date>2008-05-05 19:08:57.0</swrc:date><swrc:abstract>Many analysis of data proceed by building a graph out of the data set and then using social network theory and similar tools on the result. However, there is no theory concerning the construction of the graph itself, even though this is a very important process. In this paper, we attempt to provide a framework in which the graph building process is formalized and studied. We show the parameters (choices) involved in constructing a graph from raw data, and propose some new ways to combine and analyze the data. We also argue the importance of this approach in several domain applications, including criminal/terrorist investigations.</swrc:abstract><swrc:hasExtraField>
    <swrc:Field swrc:key="location" swrc:value="Chicago, Illinois"/>
  </swrc:hasExtraField>
<swrc:hasExtraField>
    <swrc:Field swrc:key="isbn" swrc:value="1-59593-215-1"/>
  </swrc:hasExtraField>
<swrc:hasExtraField>
    <swrc:Field swrc:key="doi" swrc:value="http://doi.acm.org/10.1145/1134271.1134274"/>
  </swrc:hasExtraField>
<swrc:author>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Antonio Badia" /></rdf:_1>
  <rdf:_2><swrc:Person swrc:name="Mehmed Kantardzic" /></rdf:_2>
  </rdf:Seq>
</swrc:author>

<swrc:editor>
  <rdf:Seq>
  </rdf:Seq>
</swrc:editor></swrc:InProceedings>  
    </burst:publication>
  </item>
<item rdf:about="http://www.bibsonomy.org/uri/bibtex/2f1dc5bb35f202f7b7d4653afa9c96035/mstrohm">
    <title>Graph building as a mining activity: finding links in the small</title>
    <description>Many analysis of data proceed by building a graph out of the data set and then using social network theory and similar
tools on the result. However, there is no theory concerning
the construction of the graph itself, even though this is a
very important process. In this paper, we attempt to provide a framework in which the graph building process is formalized and studied. We show the parameters (choices) involved in constructing a graph from raw data, and propose some new ways to combine and analyze the data. We also argue the importance of this approach in several domain applications, including criminal/terrorist investigations.</description><link>http://www.bibsonomy.org/bibtex/2f1dc5bb35f202f7b7d4653afa9c96035/mstrohm</link>
    <dc:creator>mstrohm</dc:creator>
    <dc:date>2008-04-08T10:15:34+02:00</dc:date>
    <dc:subject>SEMINAL graphs reading-group social-factors web-science </dc:subject>
    <content:encoded>
	    <![CDATA[
        <div class="block">
	      <div class="bmtitle">

  <a href="http://www.bibsonomy.org/bibtex/2f1dc5bb35f202f7b7d4653afa9c96035/mstrohm">Graph building as a mining activity: finding links in the small</a>
</div>
<div class="bmdesc">
  <span style="color:#555555;"> 
    A. <a href="http://www.bibsonomy.org/author/Badia">Badia</a>         	     	 
        	  and M. <a href="http://www.bibsonomy.org/author/Kantardzic">Kantardzic</a>         	     	 
        	 </span> 
  <em>Proceedings of the 3rd International Workshop on Link Discovery</em>
    17--24
  (2005)
</div>
<span class="bmmeta">
  
  
        to
        <span class="bmtags">
        <a href="http://www.bibsonomy.org/user/mstrohm/SEMINAL">SEMINAL</a>
        <a href="http://www.bibsonomy.org/user/mstrohm/graphs">graphs</a>
        <a href="http://www.bibsonomy.org/user/mstrohm/reading-group">reading-group</a>
        <a href="http://www.bibsonomy.org/user/mstrohm/social-factors">social-factors</a>
        <a href="http://www.bibsonomy.org/user/mstrohm/web-science">web-science</a>
        </span>
        

          by <a href="http://www.bibsonomy.org/user/mstrohm">mstrohm</a> 
        
        
        on 2008-04-08 10:15:34 </span></div>
	    ]]>
    </content:encoded>
    <taxo:topics>
      <rdf:Bag>
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/SEMINAL" />
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/graphs" />
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/reading-group" />
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/social-factors" />
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/web-science" />
        </rdf:Bag>
    </taxo:topics>
    <burst:publication>
      <swrc:InProceedings>
        <swrc:booktitle>Proceedings of the 3rd International Workshop on Link Discovery</swrc:booktitle><swrc:pages>17--24</swrc:pages><swrc:publisher><swrc:Organization swrc:name="ACM Press New York, NY, USA"/></swrc:publisher><swrc:title>{Graph building as a mining activity: finding links in the small}</swrc:title><swrc:year>2005</swrc:year><swrc:keywords>SEMINAL graphs reading-group social-factors web-science </swrc:keywords><swrc:date>2008-04-08 10:15:34.0</swrc:date><swrc:author>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="A. Badia" /></rdf:_1>
  <rdf:_2><swrc:Person swrc:name="M. Kantardzic" /></rdf:_2>
  </rdf:Seq>
</swrc:author>

<swrc:editor>
  <rdf:Seq>
  </rdf:Seq>
</swrc:editor></swrc:InProceedings>  
    </burst:publication>
  </item>
</rdf:RDF>