Back to search

North Dakota State University

Mining Frequent Coherent Patterns from Weighted Graphs

Abstract

dc:description.abstract

Current research on network analysis; such as community detection, pattern mining and many other graph mining application mostly focus on large social or biological networks. Such experiments may find interesting patterns that helps us to understand the unknown relationship within the network. Sometimes the size of the input networks are so big that it needs an efficient algorithm to overcome the time and space complexities. In this paper we modify an existing algorithm that finds the maximal patterns from a set of input networks. Maximal patterns are those patterns that are not part of any frequent patterns. We introduce a new relational attributes to our algorithm from the input networks, we call them the edge attributes. We have tested our algorithm on a co-author relationship database; and after analyzing we have found some interesting characteristics of the input dataset.

Degree

thesis:*
Grantor dc:publisher
North Dakota State University
Year dc:date.issued
2014

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Ahmed, Syed Kutub Uddin

Subjects

dc:subject × 4

Rights

dc:rights
Statement dc:rights
  • NDSU Policy 190.6.2

Identifiers

dc:identifier.*
Handle dc:identifier.uri
https://hdl.handle.net/10365/24138

Chain of custody

source
Harvested from
North Dakota State University
Base URL
library.ndsu.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Ahmed, Syed Kutub Uddin. Mining Frequent Coherent Patterns from Weighted Graphs. North Dakota State University, 2014. https://hdl.handle.net/10365/24138