Görür, Abdül Kadir
Loading...
Name Variants
Job Title
Dr. Öğr. Üyesi
Email Address
agorur@cankaya.edu.tr
Main Affiliation
Bilgisayar Mühendisliği
Status
Current Staff
Website
ORCID ID
Scopus Author ID
Turkish CoHE Profile ID
Google Scholar ID
WoS Researcher ID
Files
Sustainable Development Goals Report Points
SDG data could not be loaded because of an error. Please refresh the page or try again later.
Scholarly Output
5
Articles
6
Citation Count
15
Supervised Theses
0
5 results
Scholarly Output Search Results
Now showing 1 - 5 of 5
Publication Production and retrieval off rough classes in multi relations(IEEE Computer Soc, 2007) Sever, Hayri; Görür, Abdül Kadir; Görür, Abdül Kadir; 11916; 107251; Bilgisayar MühendisliğiOrganizational memory in today's business world forms basis for organizational learning, which is the ability of an organization to gain insight and understanding from experience through experimentation, observation, analysis, and a willingness to examine both successes and failures. This basically requires consideration of different aspects of knowledge that may reside on top of a conventional information management system. Of them, representation, retrieval and production issues of meta patterns constitute to the main theme of this article. Particularly we are interested in a formal approach to handle rough concepts. We utilize rough classifiers to propose a preliminary framework based on minimal term sets with p-norms to extract meta patterns. We describe a relational rule induction approach, which is called rila. Experimental results are provided on the mutagenesis, and the KDD Cup 2001 genes data sets.Article Citation - WoS: 1Citation - Scopus: 4A Comparative Evaluation Of Popular Search Engines On Finding Turkish Documents For A Specific Time Period(Univ Osijek, Tech Fac, 2017) Bitirim, Yiltan; Görür, Abdül Kadir; Gorur, Abdul Kadir; 107251; Bilgisayar MühendisliğiThis study evaluates the popular search engines, Google, Yahoo, Bing, and Ask, on finding Turkish documents by comparing their current performances with their performances measured six years ago. Furthermore, the study reveals the current information retrieval effectiveness of the search engines. First of all, the Turkish queries were run on the search engines separately. Each retrieved document was classified and precision ratios were calculated at various cut-off points for each query and engine pair. Afterwards, these ratios were compared with the six years ago ratios for the evaluations. Besides the descriptive statistics, Mann-Whitney U and Kruskal-Wallis H statistical tests were used in order to find out statistically significant differences. All search engines, except Google, have better performance today. Bing has the most increased performance compared to six years ago. Nowadays: Yahoo has the highest mean precision ratios at various cut-off points; all search engines have their highest mean precision ratios at cut-off point 5; dead links were encountered in Google, Bing, and Ask; and repeated documents were encountered in Google and Yahoo.Article Citation - WoS: 2Citation - Scopus: 3Single-Machine Scheduling of Indivisible Multi-Operatıon Jobs(Southern African inst industrial Engineering, 2019) Çetinkaya, Ferda Can; Cetinkaya, F. C.; Catmakas, H. A.; Görür, Abdül Kadir; Gorur, A. K.; 50129; 57532; 107251; Endüstri Mühendisliği; Bilgisayar MühendisliğiThis paper considers a single-machine scheduling problem of multi-operation jobs where each job consists of several operations processed contiguously, rather than being intermingled with the operations of different jobs. That is, the jobs are indivisible. A sequence-independent setup is required if the machine switches from one operation to another. However, no setup is necessary before the first operation of a job if this first operation is the same as the last operation of the immediately previous job. A job is complete when all of its operations have been processed. We investigate the problem for two cases. Makespan, which is the time needed to complete all jobs, is minimised in the first case; whereas the total completion time, which is the sum of the job completion times, is minimised in the second case. We show that the makespan problem is solvable in polynomial time. For the problem of minimising total completion time, we develop a mixed integer linear programming (MILP) model, which is capable of solving small and medium-sized problem instances optimally, and obtain a very small gap between the solution found and the best possible solution for the unsolved large-sized problem instances.Conference Object Citation - WoS: 6Citation - Scopus: 8A Real Time Data Warehouse Approach for Data Processing(Ieee, 2013) Obali, M.; Görür, Abdül Kadir; Dursun, B.; Erdem, Z.; Görür, A.K.; 107251; Bilgisayar MühendisliğiData that is acquired from different data sources needs too much processing for managing, analyzing and monitoring. Also, you have to fuse and exploit efficiently these data and display the results. Data warehouse consolidates data coming from different data sources. A real time data warehouse is used same purpose as data warehouse, in addition to these, data streams into real time data warehouse on time. Therefore, real time data warehouses can be used in many different areas, such as signal processing, data analysis. In this study, we proposed and implement a real time data warehouse using web services as a prototype. © 2013 IEEE.Article Author identification for Turkish texts(Çankaya Üniversitesi, 2007) Görür, Abdül Kadir; Görür, Abdül Kadir; Bilgisayar MühendisliğiThe main concern of author identification is to define an appropriate characterization of documents that captures the writing style of authors. The most important approaches to computer-based author identification are exclusively based on lexical measures. In this paper we presented a fully automated approach to the identification of the authorship of unrestricted text by adapting a set of style markers to the analysis of the text. In this study, 35 style markers were applied to each author. By using our method, the author of a text can be identified by using the style markers that characterize a group of authors. The author group consists of 20 different writers. Author features including style markers were derived together with different machine learning algorithms. By using our method we have obtained a success rate of 80% in avarege
