Finding co-authorship patterns by frequent patterns
In the growing emphasis and importance of big data, where data are constantly increasing, mining those data became an essential task in these years in order to generate new useful information, that would improve our daily lives. Frequent pattern mining, a key task of identifying relationships in dat...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Final Year Project (FYP) |
| Language: | English |
| Published: |
2015
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10356/63056 |
| _version_ | 1811694237969809408 |
|---|---|
| author | Tan, Jomain Zi Hao |
| author2 | He Bingsheng |
| author_facet | He Bingsheng Tan, Jomain Zi Hao |
| author_sort | Tan, Jomain Zi Hao |
| collection | NTU |
| description | In the growing emphasis and importance of big data, where data are constantly increasing, mining those data became an essential task in these years in order to generate new useful information, that would improve our daily lives. Frequent pattern mining, a key task of identifying relationships in data remains one of the most important tasks of data mining. Frequent pattern mining reveals new useful information that was once hidden in large datasets of data, and it allows broad real life application such as customer behavioral analysis. Apriori and FP- Growth are two basic and well-known algorithms that are used for frequent pattern mining. Google Scholar, a search engine by Google, allows users to search for published papers. Google Scholar indexed an extensive collection of published papers, and the general public is able to use the search engine to find related papers through the author name or the title of publish papers. While Google Scholar returns accurate and reliable results, there are some specific areas of search that are not implemented, such as our scope of interest in this project. This project will compare and explore two frequent itemset mining algorithms, Apriori and Fp- growth by search ingfor co-authorship patterns. |
| first_indexed | 2024-10-01T07:04:23Z |
| format | Final Year Project (FYP) |
| id | ntu-10356/63056 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2024-10-01T07:04:23Z |
| publishDate | 2015 |
| record_format | dspace |
| spelling | ntu-10356/630562023-03-03T20:44:47Z Finding co-authorship patterns by frequent patterns Tan, Jomain Zi Hao He Bingsheng School of Computer Engineering DRNTU::Engineering::Computer science and engineering::Computing methodologies::Pattern recognition In the growing emphasis and importance of big data, where data are constantly increasing, mining those data became an essential task in these years in order to generate new useful information, that would improve our daily lives. Frequent pattern mining, a key task of identifying relationships in data remains one of the most important tasks of data mining. Frequent pattern mining reveals new useful information that was once hidden in large datasets of data, and it allows broad real life application such as customer behavioral analysis. Apriori and FP- Growth are two basic and well-known algorithms that are used for frequent pattern mining. Google Scholar, a search engine by Google, allows users to search for published papers. Google Scholar indexed an extensive collection of published papers, and the general public is able to use the search engine to find related papers through the author name or the title of publish papers. While Google Scholar returns accurate and reliable results, there are some specific areas of search that are not implemented, such as our scope of interest in this project. This project will compare and explore two frequent itemset mining algorithms, Apriori and Fp- growth by search ingfor co-authorship patterns. Bachelor of Engineering (Computer Science) 2015-05-05T07:52:35Z 2015-05-05T07:52:35Z 2015 2015 Final Year Project (FYP) http://hdl.handle.net/10356/63056 en Nanyang Technological University 50 p. application/pdf |
| spellingShingle | DRNTU::Engineering::Computer science and engineering::Computing methodologies::Pattern recognition Tan, Jomain Zi Hao Finding co-authorship patterns by frequent patterns |
| title | Finding co-authorship patterns by frequent patterns |
| title_full | Finding co-authorship patterns by frequent patterns |
| title_fullStr | Finding co-authorship patterns by frequent patterns |
| title_full_unstemmed | Finding co-authorship patterns by frequent patterns |
| title_short | Finding co-authorship patterns by frequent patterns |
| title_sort | finding co authorship patterns by frequent patterns |
| topic | DRNTU::Engineering::Computer science and engineering::Computing methodologies::Pattern recognition |
| url | http://hdl.handle.net/10356/63056 |
| work_keys_str_mv | AT tanjomainzihao findingcoauthorshippatternsbyfrequentpatterns |