Please use this identifier to cite or link to this item:
|Title:||Efficiently finding the best parameter for the emerging pattern-based classifier PCL|
|Authors:||Ngo, T.-S. |
|Citation:||Ngo, T.-S.,Feng, M.,Liu, G.,Wong, L. (2010). Efficiently finding the best parameter for the emerging pattern-based classifier PCL. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6118 LNAI (PART 1) : 121-133. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-13657-3_15|
|Abstract:||Emerging patterns are itemsets whose frequencies change sharply from one class to the other. PCL is an example of efficient classification algorithms that leverage the prediction power of emerging patterns. It first selects the top-K emerging patterns of each class that match a testing instance, and then uses these selected patterns to decide the class label of the testing instance. We study the impact of the parameter K on the accuracy of PCL. We have observed that in many cases, the value of K is critical to the performance of PCL. This motivates us to develop an algorithm to find the best value of K for PCL. Our results show that finding the best K can improve the accuracy of PCL greatly, and employing incremental frequent itemset maintenance techniques reduces the running time of our algorithm significantly. © 2010 Springer-Verlag Berlin Heidelberg.|
|Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 20, 2019
checked on Dec 29, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.