@article{firth57synopsis,
        title = {A synopsis of linguistic theory 1930-55.},
        address = {Oxford},
        author = {J. R. Firth},
        booktitle = {Studies in Linguistic Analysis (special volume of the Philological Society)},
        pages = {1-32},
        publisher = {The Philological Society},
        volume = {1952-59},
        year = 1957,
        abstract = {Reprinted in:  Palmer, F. R. (ed.) (1968). Selected Papers of J. R. Firth 1952-59, pages 168-205. Longmans, London. },
	biburl = {http://www.bibsonomy.org/bibtex/25e3d6c72cdd123a638f71886d78f3c1e/stumme},
	keywords = {theory distributional measures similarity relatedness measure}
}

@article{stumme98free,
        title = {Free Distributive Completions of Partial Complete Lattices},
        author = {Gerd Stumme},
        journal = {{In:} {O}rder},
        pages = {179-189},
        volume = 14,
        year = 1998,
        url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2000/SIGKDD_Explorations00.ps},
        comment = {alpha},
	biburl = {http://www.bibsonomy.org/bibtex/2de157d21efb3d9723fb937be024f84cd/stumme},
	keywords = {formal theory fca distributive completions concept free analysis distributivity 1998 lattices lattice myown complete}
}

@inproceedings{schmitz2006content,
        title = {Content Aggregation on Knowledge Bases using Graph Clustering},
        address = {Heidelberg},
        author = {Christoph Schmitz and Andreas Hotho and Robert Jäschke and Gerd Stumme},
        booktitle = {The Semantic Web: Research and Applications},
        editor = {York Sure and John Domingue},
        pages = {530-544},
        publisher = {Springer},
        series = {LNAI},
        volume = 4011,
        year = 2006,
        url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2006/schmitz2006content.pdf},
        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.},
	biburl = {http://www.bibsonomy.org/bibtex/21788c88e04112a4491f19dfffb8dc39e/stumme},
	keywords = {theory clustering content nepomuk seminar2006 aggregation graph 2006 ontology ontologies l3s myown}
}