QuickSearch:   Number of matching entries: 0.

Search Settings

    AuthorTitleYearJournal/ProceedingsReftypeDOI/URL
    Schmitz, C., Hotho, A., Jäschke, R. & Stumme, G. Content Aggregation on Knowledge Bases using Graph Clustering

    [BibTeX]

    		 2006
    Vol. 4011Proceedings of the 3rd European Semantic Web Conference, pp. 530-544     		 inproceedings URL 
    BibTeX: 
    @inproceedings{schmitz2006content,
  author = {Schmitz, Christoph and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd},
  title = {Content Aggregation on Knowledge Bases using Graph Clustering},
  booktitle = {Proceedings of the 3rd European Semantic Web Conference},
  publisher = {Springer},
  year = {2006},
  volume = {4011},
  pages = {530-544},
  url = {http://www.kde.cs.uni-kassel.de/hotho/pub/2006/schmitz2006sumarize_eswc.pdf}
}
    Schmitz, C., Hotho, A., Jäschke, R. & Stumme, G. Content Aggregation on Knowledge Bases using Graph Clustering

    [Abstract] [BibTeX]

    		 2006
    Vol. 4011The Semantic Web: Research and Applications, pp. 530-544     		 inproceedings URL 
    Abstract: Recently, research projects such as PADLR and SWAP
    have developed tools like Edutella or Bibster, which are targeted at
    establishing peer-to-peer knowledge management (P2PKM) systems. In
    such a system, it is necessary to obtain provide brief semantic
    descriptions of peers, so that routing algorithms or matchmaking
    processes can make decisions about which communities peers should
    belong to, or to which peers a given query should be forwarded.

    This paper provides a graph clustering technique on
    knowledge bases for that purpose. Using this clustering, we can show
    that our strategy requires up to 58% fewer queries than the
    baselines to yield full recall in a bibliographic P2PKM scenario.
    BibTeX: 
    @inproceedings{schmitz2006content,
  author = {Schmitz, Christoph and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd},
  title = {Content Aggregation on Knowledge Bases using Graph Clustering},
  booktitle = {The Semantic Web: Research and Applications},
  publisher = {Springer},
  year = {2006},
  volume = {4011},
  pages = {530-544},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2006/schmitz2006content.pdf}
}
    Soderberg, B. General formalism for inhomogeneous random graphs

    [BibTeX]

    		 2002 Phys. Rev. E
    Vol. 66(6), pp. 066121     		 article  
    BibTeX: 
    @article{soderberg2002gfi,
  author = {Soderberg, B.},
  title = {General formalism for inhomogeneous random graphs},
  journal = {Phys. Rev. E},
  publisher = {APS},
  year = {2002},
  volume = {66},
  number = {6},
  pages = {066121}
}
    Molloy, M. & Reed, B. A critical point for random graphs with a given degree sequence

    [BibTeX]

    		 1995 Random Structures & Algorithms
    Vol. 6, pp. 161-179     		 misc URL 
    BibTeX: 
    @misc{molloy_reed95,
  author = {Molloy, M. and Reed, B.},
  title = {A critical point for random graphs with a given degree sequence},
  journal = {Random Structures & Algorithms},
  year = {1995},
  volume = {6},
  pages = {161-179},
  url = {/brokenurl#citeseer.ist.psu.edu/molloy95critical.html}
}
    Frank, O. Random sampling and social networks: a survey of various approaches

    [BibTeX]

    		 1988 Math. Sci. Humaines
    Vol. 104, pp. 19-33     		 article  
    BibTeX: 
    @article{frank1988rsa,
  author = {Frank, O.},
  title = {Random sampling and social networks: a survey of various approaches},
  journal = {Math. Sci. Humaines},
  year = {1988},
  volume = {104},
  pages = {19--33}
}
    Karonski, M. A review of random graphs

    [BibTeX]

    		 1982 Journal of Graph Theory
    Vol. 6(4)     		 article  
    BibTeX: 
    @article{karonski1982rrg,
  author = {Karonski, M.},
  title = {A review of random graphs},
  journal = {Journal of Graph Theory},
  publisher = {Wiley Subscription Services, Inc., A Wiley Company New York},
  year = {1982},
  volume = {6},
  number = {4}
}

    Created by JabRef on 27/04/2024.