loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Author: Natalia Vanetik

Affiliation: Ben Gurion University, Israel

Keyword(s): Mining graphs, Graph connectivity.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Knowledge Discovery and Information Retrieval ; Knowledge-Based Systems ; Mining Text and Semi-Structured Data ; Soft Computing ; Symbolic Systems ; Web Mining

Abstract: Many real-life data sets, such as social and biological networks and biochemical data, are naturally and easily modeled as large labeled graphs. Finding patterns of interest in these graphs is an important task, due to the nature of the data not all of the patterns need to be taken into account. Intuitively, if a pattern has high connectivity, it implies that there is a strong connection between data items. In this paper, we present a novel algorithm for finding frequent graph patterns with prescribed connectivity in large single-graph data sets. We employ the Dinitz-Karzanov-Lomonosov cactus minimum cut structure of a graph to perform the task efficiently. We also prove that the suggested algorithm generates no more candidate graphs than any other algorithm whose graph extension procedure we use at the first step.

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.17.150.163

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Vanetik, N. (2011). A FAST ALGORITHM FOR MINING GRAPHS OF PRESCRIBED CONNECTIVITY. In Proceedings of the International Conference on Knowledge Discovery and Information Retrieval (IC3K 2011) - KDIR; ISBN 978-989-8425-79-9; ISSN 2184-3228, SciTePress, pages 5-13. DOI: 10.5220/0003628300050013

@conference{kdir11,
author={Natalia Vanetik.},
title={A FAST ALGORITHM FOR MINING GRAPHS OF PRESCRIBED CONNECTIVITY},
booktitle={Proceedings of the International Conference on Knowledge Discovery and Information Retrieval (IC3K 2011) - KDIR},
year={2011},
pages={5-13},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003628300050013},
isbn={978-989-8425-79-9},
issn={2184-3228},
}

TY - CONF

JO - Proceedings of the International Conference on Knowledge Discovery and Information Retrieval (IC3K 2011) - KDIR
TI - A FAST ALGORITHM FOR MINING GRAPHS OF PRESCRIBED CONNECTIVITY
SN - 978-989-8425-79-9
IS - 2184-3228
AU - Vanetik, N.
PY - 2011
SP - 5
EP - 13
DO - 10.5220/0003628300050013
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic