文章基本信息

标题：Calculation Algorithm Complexity of Porter’s Algorithm in Information Retrieval
本地全文：下载
作者：Lasmedi Afuan ; Retantyo Wardoyo
期刊名称：International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
印刷版ISSN：2278-1323
出版年度：2017
卷号：6
期号：7
页码：1010-1012
出版社：Shri Pannalal Research Institute of Technolgy
摘要：Complexity is part of a computer science related to the use of algorithms in a particular application. The complexity of the algorithm is divided into two, namely the complexity of time and space complexity. Measured time complexity of computing the number of stages required to run the algorithm as a function of a number of data n (size of the input). This study calculating complexity on one stemming algorithms commonly used in Information Retrieval that is Porter's Algorithm. The complexity of the calculations done using ruang.Tahapan complexity approach taken is to translate the flowchart of stages Porter to pseudocode, then calculate the time complexity. The final conclusion is that the time complexity of the Porter's algorithm is O (7).
关键词：Complexity; porter's algorithm; information retrieval.