Back to search

North Dakota State University

Mining Connected Frequent Boolean Expressions

Abstract

dc:description.abstract

In this paper, we are finding Connected Frequent Boolean Expressions from cancer dataset [14] and protein protein interaction network [14] to discover group of dysregulated genes. Frequent Itemset Mining is a process of finding different sets of items that occur together frequently in a set of transactions. These itemsets are called Frequent Itemsets (FBE). Connected FBE (CFBE) are a group of items that not only classify as FBE but they are also connected in a graph/network. The nodes in this graph are the items and the edges between them indicate relationships. This can particularly be very helpful in cases where the items are not independent of each other and the presence of one item with another specific item can decide whether the group of items will be frequent or not.

Degree

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

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Kolte, Deepak

Subjects

dc:subject × 6

Rights

dc:rights
Statement dc:rights
  • NDSU Policy 190.6.2

Identifiers

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

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

Kolte, Deepak. Mining Connected Frequent Boolean Expressions. North Dakota State University, 2017. https://hdl.handle.net/10365/26361