Geodesic distances for clustering linked text data

Cite This

Files in this item

Files Size Format View

There are no files associated with this item.

TEKIR, Selma, Florian MANSMANN, Daniel KEIM, 2012. Geodesic distances for clustering linked text data. In: Journal of Artificial Intelligence and Soft Computing Research. 2(3), pp. 247-258. eISSN 2083-2567

@article{Tekir2012Geode-38215, title={Geodesic distances for clustering linked text data}, year={2012}, number={3}, volume={2}, journal={Journal of Artificial Intelligence and Soft Computing Research}, pages={247--258}, author={Tekir, Selma and Mansmann, Florian and Keim, Daniel} }

<rdf:RDF xmlns:dcterms="" xmlns:dc="" xmlns:rdf="" xmlns:bibo="" xmlns:dspace="" xmlns:foaf="" xmlns:void="" xmlns:xsd="" > <rdf:Description rdf:about=""> <dc:date rdf:datatype="">2017-03-30T08:42:58Z</dc:date> <dcterms:title>Geodesic distances for clustering linked text data</dcterms:title> <bibo:uri rdf:resource=""/> <dspace:isPartOfCollection rdf:resource=""/> <dcterms:issued>2012</dcterms:issued> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:creator>Mansmann, Florian</dc:creator> <dcterms:abstract xml:lang="eng">The quality of a clustering not only depends on the chosen algorithm and its parameters, but also on the definition of the similarity of two respective objects in a dataset. Applications such as clustering of web documents is traditionally built either on textual similarity measures or on link information. Due to the incompatibility of these two information spaces, combining these two information sources in one distance measure is a challenging issue. In this paper, we thus propose a geodesic distance function that combines traditional similarity measures with link information. In particular, we test the effectiveness of geodesic distances as similarity measures under the space assumption of spherical geometry in a 0-sphere. Our proposed distance measure is thus a combination of the cosine distance of the term-document matrix and some curvature values in the geodesic distance formula. To estimate these curvature values, we calculate clustering coefficient values for every document from the link graph of the data set and increase their distinctiveness by means of a heuristic as these clustering coefficient values are rough estimates of the curvatures. To evaluate our work, we perform clustering tests with the k-means algorithm on a subset of the EnglishWikipedia hyperlinked data set with both traditional cosine distance and our proposed geodesic distance. Additionally, taking inspiration from the unified view of the performance functions of k-means and k-harmonic means, min and harmonic average of the cosine and geodesic distances are taken in order to construct alternate distance forms. The effectiveness of our approach is measured by computing microprecision values of the clusters based on the provided categorical information of each article.</dcterms:abstract> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:creator>Keim, Daniel</dc:creator> <dcterms:isPartOf rdf:resource=""/> <dc:language>eng</dc:language> <dcterms:available rdf:datatype="">2017-03-30T08:42:58Z</dcterms:available> <dc:contributor>Keim, Daniel</dc:contributor> <dc:creator>Tekir, Selma</dc:creator> <dc:contributor>Mansmann, Florian</dc:contributor> <dc:contributor>Tekir, Selma</dc:contributor> </rdf:Description> </rdf:RDF>

This item appears in the following Collection(s)

Search KOPS


My Account