2003 | OriginalPaper | Buchkapitel
Two Models of Random Intersection Graphs for Classification
verfasst von : E. Godehardt, J. Jaworski
Erschienen in: Exploratory Data Analysis in Empirical Research
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Graph concepts generally are usefulfor defining and detecting clusters. We consider basic properties of random intersection graphs generated by a random bipartite graph BG n, m on n+m vertices. In particular, we focus on the distr ibution of the number of isolated vertices, and on the distribution of the vertex degrees. These results are applied to study the asymptotic properties of such random intersection graphs for the special case that the distribution P(m) is degenerated. The application of this model to find clusters and to test their randomness especially for non-metric data is discussed.