Java, A.; Joshi, A. & FininBook, T.: Approximating the Community Structure of the Long Tail. Proceedings of the Second International Conference on Weblogs and Social Media(ICWSM 2008). AAAI Press, 2008
[Volltext]
In many social media applications, a small fraction of the members are highly linked while most are sparsely connected to the network. Such a skewed distribution is sometimes referred to as the"long tail". Popular applications like meme trackers and content aggregators mine for information from only the popular blogs located at the head of this curve. On the other hand, the long tail contains large volumes of interesting information and niches. The question we address in this work is how best to approximate the community membership of entities in the long tail using only a small percentage of the entire graph structure. Our technique utilizes basic linear algebra manipulations and spectral methods. It has the advantage of quickly and efficiently finding a reasonable approximation of the community structure of the overall network. Such a method has significant applications in blog analysis engines as well as social media monitoring tools in general.
@inproceedings{Approximating2008Java,
author = {Java, Akshay and Joshi, Anupam and FininBook, Tim},
title = {Approximating the Community Structure of the Long Tail},
booktitle = {Proceedings of the Second International Conference on Weblogs and Social Media(ICWSM 2008)},
publisher = {AAAI Press},
year = {2008},
url = {http://ebiquity.umbc.edu/paper/html/id/381/Approximating-the-Community-Structure-of-the-Long-Tail},
keywords = {clustering, community, detection, spectral, svd},
abstract = {In many social media applications, a small fraction of the members are highly linked while most are sparsely connected to the network. Such a skewed distribution is sometimes referred to as the"long tail". Popular applications like meme trackers and content aggregators mine for information from only the popular blogs located at the head of this curve. On the other hand, the long tail contains large volumes of interesting information and niches. The question we address in this work is how best to approximate the community membership of entities in the long tail using only a small percentage of the entire graph structure. Our technique utilizes basic linear algebra manipulations and spectral methods. It has the advantage of quickly and efficiently finding a reasonable approximation of the community structure of the overall network. Such a method has significant applications in blog analysis engines as well as social media monitoring tools in general. }
}
Ranade, A.: Some uses of spectral methods. , 2000
@unpublished{ranade:sus,
author = {Ranade, A.G.},
title = {Some uses of spectral methods},
year = {2000},
keywords = {clustering, graph, spectral, svd, theory}
}