Algorithms and methods on complete dense bipartite graph are presented in this document for emerging small communities - websites which mention a common subject. These methods allow finding communities, which would not be found by HITS or CLEVER algorithm.
The workshop focuses on current research trends in technology enhanced learning solutions that aim at addressing the multiplicity and complexity of needs of Communities of Practice all along their lifecycle.
This dissertations presents an algorithm on the webgraph for finding dense bipartite graphs wich represents web-communities.
By performing further steps of the algorithm several levels of communities are recognized which can be related to communites of former levels.
The authors of this document define a community consisting of several web sites with a common subject.
They explain an algorithm for crawling the web for communities using a maximum flow algorithm of the web graph
This paper aims at giving a more detailed description and discussion of two concepts of “community” developed in the research areas of text production/writing and social learning / information management / knowledge sharing and comparing them with ea
P. Hui, E. Yoneki, S. Chan, и J. Crowcroft. Proceedings of 2nd ACM/IEEE international workshop on Mobility in the evolving internet architecture, стр. 1--8. New York, NY, USA, ACM, (2007)
L. Backstrom, D. Huttenlocher, J. Kleinberg, и X. Lan. Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, стр. 44--54. New York, NY, USA, ACM, (2006)