Abstract | ||
---|---|---|
Discretization is the process of converting continuous values into discrete values. It is crucial for several machine learning and data mining algorithms as certain algorithms work only on discrete values. In this study we investigate applicability of Ramer-Douglas-Peucker (RDP) algorithm as a discretization method. Experimental results demonstrate that RDP-based discretization achieves similar or better classification accuracy compared to equal width, equal frequency, Zeta and 1R. |
Year | Venue | Keywords |
---|---|---|
2018 | Signal Processing and Communications Applications Conference | discretization,Ramer-Douglas-Peucker algorithm,line fitting |
Field | DocType | ISSN |
Discretization,Ramer–Douglas–Peucker algorithm,Pattern recognition,Computer science,Algorithm,Artificial intelligence,Knowledge extraction,Data mining algorithm | Conference | 2165-0608 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Furkan Goz | 1 | 0 | 0.68 |
Alev Mutlu | 2 | 22 | 7.19 |
Orhan Akbulut | 3 | 36 | 5.46 |