Skip to main content
Conference Proceedings

Random intersection graphs and classification

Studies in Classification, Data Analysis, and Knowledge Organization (2007) 67-74
DOI: 10.1007/978-3-540-70981-7_8
26Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We study properties of random intersection graphs generated by a random bipartite graph. We focus on the connectedness of these random intersection graphs and give threshold functions for this property and results for the size of the largest components in such graphs. The application of intersection graphs to find clusters and to test their randomness in sets of non-metric data is shortly discussed.

Cite

CITATION STYLE

APA

Godehardt, E., Jaworski, J., & Rybarczyk, K. (2007). Random intersection graphs and classification. In Studies in Classification, Data Analysis, and Knowledge Organization (pp. 67–74). Kluwer Academic Publishers. https://doi.org/10.1007/978-3-540-70981-7_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free