| dc.contributor.author | Kolte, Deepak | |
| 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. | en_US |
| dc.publisher | North Dakota State University | en_US |
| dc.rights | NDSU Policy 190.6.2 | |
| dc.title | Mining Connected Frequent Boolean Expressions | en_US |
| dc.type | Master's paper | en_US |
| dc.date.accessioned | 2017-08-16T15:27:59Z | |
| dc.date.available | 2017-08-16T15:27:59Z | |
| dc.date.issued | 2017 | |
| dc.identifier.uri | https://hdl.handle.net/10365/26361 | |
| dc.subject | Data mining. | en_US |
| dc.subject | Boolean expressions. | en_US |
| dc.subject | Graph mining. | en_US |
| dc.subject.lcsh | Data mining. | en_US |
| dc.subject.lcsh | Pattern recognition systems. | en_US |
| dc.subject.lcsh | Association rule mining. | en_US |
| dc.subject.lcsh | Algorithms. | en_US |
| dc.rights.uri | https://www.ndsu.edu/fileadmin/policy/190.pdf | |
| ndsu.degree | Master of Science (MS) | en_US |
| ndsu.college | Engineering | en_US |
| ndsu.department | Computer Science | en_US |
| ndsu.program | Computer Science | en_US |
| ndsu.advisor | Salem, Saeed | |
