A graph-based clustering scheme for identifying related tags in folksonomies
S. Papadopoulos, Y. Kompatsiaris, и A. Vakali. Proceedings of the 12th international conference on Data warehousing and knowledge discovery, стр. 65--76. Berlin, Heidelberg, Springer-Verlag, (2010)
Аннотация
The paper presents a novel scheme for graph-based clustering with the goal of identifying groups of related tags in folksonomies. The proposed scheme searches for core sets, i.e. groups of nodes that are densely connected to each other by efficiently exploring the two-dimensional core parameter space, and successively expands the identified cores by maximizing a local subgraph quality measure. We evaluate this scheme on three real-world tag networks by assessing the relatedness of same-cluster tags and by using tag clusters for tag recommendation. In addition, we compare our results to the ones derived from a baseline graph-based clustering method and from a popular modularity maximization clustering method.
Описание
A graph-based clustering scheme for identifying related tags in folksonomies
%0 Conference Paper
%1 papadopoulos2010graphbased
%A Papadopoulos, Symeon
%A Kompatsiaris, Yiannis
%A Vakali, Athena
%B Proceedings of the 12th international conference on Data warehousing and knowledge discovery
%C Berlin, Heidelberg
%D 2010
%I Springer-Verlag
%K community detection folksonomy local modularity
%P 65--76
%T A graph-based clustering scheme for identifying related tags in folksonomies
%U http://dl.acm.org/citation.cfm?id=1881923.1881931
%X The paper presents a novel scheme for graph-based clustering with the goal of identifying groups of related tags in folksonomies. The proposed scheme searches for core sets, i.e. groups of nodes that are densely connected to each other by efficiently exploring the two-dimensional core parameter space, and successively expands the identified cores by maximizing a local subgraph quality measure. We evaluate this scheme on three real-world tag networks by assessing the relatedness of same-cluster tags and by using tag clusters for tag recommendation. In addition, we compare our results to the ones derived from a baseline graph-based clustering method and from a popular modularity maximization clustering method.
%@ 3-642-15104-3, 978-3-642-15104-0
@inproceedings{papadopoulos2010graphbased,
abstract = {The paper presents a novel scheme for graph-based clustering with the goal of identifying groups of related tags in folksonomies. The proposed scheme searches for core sets, i.e. groups of nodes that are densely connected to each other by efficiently exploring the two-dimensional core parameter space, and successively expands the identified cores by maximizing a local subgraph quality measure. We evaluate this scheme on three real-world tag networks by assessing the relatedness of same-cluster tags and by using tag clusters for tag recommendation. In addition, we compare our results to the ones derived from a baseline graph-based clustering method and from a popular modularity maximization clustering method.},
acmid = {1881931},
added-at = {2012-01-17T11:19:37.000+0100},
address = {Berlin, Heidelberg},
author = {Papadopoulos, Symeon and Kompatsiaris, Yiannis and Vakali, Athena},
biburl = {https://www.bibsonomy.org/bibtex/2c5fd5d4042251d7a8654285aa20451ec/folke},
booktitle = {Proceedings of the 12th international conference on Data warehousing and knowledge discovery},
description = {A graph-based clustering scheme for identifying related tags in folksonomies},
interhash = {dcd3c48fe161b98ba016c64bc17dc787},
intrahash = {c5fd5d4042251d7a8654285aa20451ec},
isbn = {3-642-15104-3, 978-3-642-15104-0},
keywords = {community detection folksonomy local modularity},
location = {Bilbao, Spain},
numpages = {12},
pages = {65--76},
publisher = {Springer-Verlag},
series = {DaWaK'10},
timestamp = {2012-01-17T11:19:37.000+0100},
title = {A graph-based clustering scheme for identifying related tags in folksonomies},
url = {http://dl.acm.org/citation.cfm?id=1881923.1881931},
year = 2010
}