Scopus İndeksli Yayınlar Koleksiyonu
Permanent URI for this collectionhttps://hdl.handle.net/20.500.12573/395
Browse
3 results
Search Results
Article Citation - Scopus: 25Recursive Cluster Elimination Based Rank Function (SVM-RCE-R) Implemented in KNIME(F1000 Research Ltd, 2021-01-05) Yousef, Malik; Bakir-Güngör, Burcu; Jabeer, Amhar; Göy, Gökhan; Qureshi, Rehman A.; C Showe, Louise; C. Showe, LouiseIn our earlier study, we proposed a novel feature selection approach, Recursive Cluster Elimination with Support Vector Machines (SVM-RCE) and implemented this approach in Matlab. Interest in this approach has grown over time and several researchers have incorporated SVM-RCE into their studies, resulting in a substantial number of scientific publications. This increased interest encouraged us to reconsider how feature selection, particularly in biological datasets, can benefit from considering the relationships of those genes in the selection process, this led to our development of SVM-RCE-R. SVM-RCE-R, further enhances the capabilities of SVM-RCE by the addition of a novel user specified ranking function. This ranking function enables the user to stipulate the weights of the accuracy, sensitivity, specificity, f-measure, area under the curve and the precision in the ranking function This flexibility allows the user to select for greater sensitivity or greater specificity as needed for a specific project. The usefulness of SVM-RCE-R is further supported by development of the maTE tool which uses a similar approach to identify MicroRNA (miRNA) targets. We have also now implemented the SVM-RCE-R algorithm in Knime in order to make it easier to applyThe use of SVM-RCE-R in Knime is simple and intuitive and allows researchers to immediately begin their analysis without having to consult an information technology specialist. The input for the Knime implemented tool is an EXCEL file (or text or CSV) with a simple structure and the output is also an EXCEL file. The Knime version also incorporates new features not available in SVM-RCE. The results show that the inclusion of the ranking function has a significant impact on the performance of SVM-RCE-R. Some of the clusters that achieve high scores for a specified ranking can also have high scores in other metrics. © 2021 Elsevier B.V., All rights reserved.Conference Object Citation - Scopus: 2Makine Öǧrenmesi Teknikleri Ile İnternet Servis Saǧlayıcısı için Müşteri Kayıp Tahmini(Institute of Electrical and Electronics Engineers Inc., 2020-09) Göy, Gökhan; Kolukisa, Burak; Bahçevan, Cenk Anıl; Güngör, Vehbi ÇağrıWith the developing technology in every fields, a competitive marketing environment has been arised. In this competitive environment, analyzing customer behavior has become vital. In particular, the ability to easily change any service provider has become very critical for the company to continue its existence. At the same time, the amount of financial resources spent on retaining customers much less than to obtain new clients. In this context, the traditional methods of examining vast amount of data obtained today for establishing decision support systems have lost their validities. In this study, we used a dataset which is provided by TurkNet serving as an internet service provider in Turkey. Various preprocessing steps has performed on this dataset and then classification algorithms ran. Afterwards results have obtained and compared. The results of these experiments analyzed in terms of the area under the curve value. In this context, the most successful classifier algorithm has been determined as the Random Trees algorithm with a value of 0.936. © 2020 Elsevier B.V., All rights reserved.Conference Object Citation - WoS: 2Citation - Scopus: 6Makine Öğrenmesi Yöntemleri ile Kredi Kartı Sahteciliğinin Tespiti(Institute of Electrical and Electronics Engineers Inc., 2019-09) Göy, Gökhan; Gezer, Cengiz; Güngör, Vehbi ÇağrıWith the increase in credit card usage of people, the credit card transactions increase dramatically. It is difficult to identify fraudulent transactions among the vast amount of credit card transactions. Although credit card fraud is limited in number of transactions, it causes serious problems in terms of financial losses for individuals and organizations. Even though large number of studies has been conducted to solve this problem, there is no generally accepted solution. In this paper, a publicly available data set is used. The unbalance problem of the data set was solved by using hybrid sampling methods together. On this data set, comparative performance evaluations have been conducted. Different from other studies, the Area Under the Curve (AUC) metric, which expresses the success in such data sets, has also been used in addition to standard performance metrics. Since it is also important to quickly detect credit card fraud transactions; the running time of different methods is also presented as another performance metric. © 2020 Elsevier B.V., All rights reserved.