Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/63056
Title: Finding co-authorship patterns by frequent patterns
Authors: Tan, Jomain Zi Hao
Keywords: DRNTU::Engineering::Computer science and engineering::Computing methodologies::Pattern recognition
Issue Date: 2015
Abstract: 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.
URI: http://hdl.handle.net/10356/63056
Rights: Nanyang Technological University
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:SCSE Student Reports (FYP/IA/PA/PI)

Files in This Item:
File Description SizeFormat 
FYP_report_Jomain_tan.pdf
  Restricted Access
Main report7.7 MBAdobe PDFView/Open

Page view(s) 50

121
checked on Oct 24, 2020

Download(s) 50

11
checked on Oct 24, 2020

Google ScholarTM

Check

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.