Bu dergideki yayınlar
2 →- MakaleAçık Erişim2017Scopus SJRQ3Automatic Mining of Quantitative Association Rules with Gravitational Search Algorithm
Can, Umit; Alatas, Bilal
The classical optimization algorithms are not efficient in solving complex search and optimization problems. Thus, some heuristic optimization algorithms have been proposed. In this paper, exploration of association rules within numerical databases with Gravitational Search Algorithm (GSA) has been firstly performed. GSA has been designed as search method for quantitative association rules from the databases which can be regarded as search space. Furthermore, determining the minimum values of confidence and support for every database which is a hard job has been eliminated by GSA. Apart from this, the fitness function used for GSA is very flexible. According to the interested problem, some parameters can be removed from or added to the fitness function. The range values of the attributes have been automatically adjusted during the time of mining of the rules. That is why there is not any requirements for the pre-processing of the data. Attributes interaction problem has also been eliminated with the designed GSA. GSA has been tested with four real databases and promising results have been obtained. GSA seems an effective search method for complex numerical sequential patterns mining, numerical classification rules mining, and clustering rules mining tasks of data mining.
AtıfScopus27WoS18OpenAlex28İncele
- MakaleAçık Erişim2017Scopus SJRQ3Web Pages Classification with Parliamentary Optimization Algorithm
Kiziloluk, Soner; Ozer, Ahmet Bedri
In recent years, data on the Internet has grown exponentially, attaining enormous dimensions. This situation makes it difficult to obtain useful information from such data. Web mining is the process of using data mining techniques such as association rules, classification, clustering, and statistics to discover and extract information from Web documents. Optimization algorithms play an important role in such techniques. In this work, the parliamentary optimization algorithm (POA), which is one of the latest social-based metaheuristic algorithms, has been adopted for Web page classification. Two different data sets (Course and Student) were selected for experimental evaluation, and HTML tags were used as features. The data sets were tested using different classification algorithms implemented in WEKA, and the results were compared with those of the POA. The POA was found to yield promising results compared to the other algorithms. This study is the first to propose the POA for effective Web page classification.
AtıfScopus11WoS9OpenAlex10İncele
Tam Kayıt
| Alan | Değer | Dil |
|---|---|---|
| creativeworkseries.issn | 0218-1940 | |
| dc.date.accessioned | 2026-10-28T14:57:12.724839219Z | |
| dc.date.available | 2026-10-28T14:57:12.724839219Z | |
| dc.identifier.uri | https://rdlopen.rawdatalibrary.net/r/munzur/3846 | |
| dc.publisher | World Scientific Publishing Co. Pte Ltd | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.title | International Journal of Software Engineering and Knowledge Engineering |
