Pub Date : 2021-10-01DOI: 10.4018/IJCINI.20211001.OA46
G. Siddesh, T. Gururaj
{"title":"Classification of Gene Expression Data Using Feature Selection Based on Type Combination Approach Model With Advanced Feature Selection Technology","authors":"G. Siddesh, T. Gururaj","doi":"10.4018/IJCINI.20211001.OA46","DOIUrl":"https://doi.org/10.4018/IJCINI.20211001.OA46","url":null,"abstract":"","PeriodicalId":43637,"journal":{"name":"International Journal of Cognitive Informatics and Natural Intelligence","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77774486","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Machine Learning Methods for Detecting Internet-of-Things (IoT) Malware","authors":"Winfred Yaokumah, J. K. Appati, D. Kumah","doi":"10.4018/IJCINI.286768","DOIUrl":"https://doi.org/10.4018/IJCINI.286768","url":null,"abstract":"","PeriodicalId":43637,"journal":{"name":"International Journal of Cognitive Informatics and Natural Intelligence","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91182730","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-01DOI: 10.4018/IJCINI.20211001.OA42
Chen Zhao, T. Utsuro, Yasuhide Kawada
This paper addresses the problem of automatic recognition of out-of-topic documents from a small set of similar documents that are expected to be on some common topic. The objective is to remove documents of noise from a set. A topic model based classification framework is proposed for the task of discovering out-of-topic documents. This paper introduces a new concept of annotated {it search engine suggests}, where this paper takes whichever search queries were used to search for a page as representations of content in that page. This paper adopted word embedding to create distributed representation of words and documents, and perform similarity comparison on search engine suggests. It is shown that search engine suggests can be highly accurate semantic representations of textual content and demonstrate that our document analysis algorithm using such representation for relevance measure gives satisfactory performance in terms of in-topic content filtering compared to the baseline technique of topic probability ranking.
{"title":"A Classification Framework of Identifying Major Documents With Search Engine Suggestions and Unsupervised Subtopic Clustering","authors":"Chen Zhao, T. Utsuro, Yasuhide Kawada","doi":"10.4018/IJCINI.20211001.OA42","DOIUrl":"https://doi.org/10.4018/IJCINI.20211001.OA42","url":null,"abstract":"This paper addresses the problem of automatic recognition of out-of-topic documents from a small set of similar documents that are expected to be on some common topic. The objective is to remove documents of noise from a set. A topic model based classification framework is proposed for the task of discovering out-of-topic documents. This paper introduces a new concept of annotated {it search engine suggests}, where this paper takes whichever search queries were used to search for a page as representations of content in that page. This paper adopted word embedding to create distributed representation of words and documents, and perform similarity comparison on search engine suggests. It is shown that search engine suggests can be highly accurate semantic representations of textual content and demonstrate that our document analysis algorithm using such representation for relevance measure gives satisfactory performance in terms of in-topic content filtering compared to the baseline technique of topic probability ranking.","PeriodicalId":43637,"journal":{"name":"International Journal of Cognitive Informatics and Natural Intelligence","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82076285","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-01DOI: 10.4018/ijcini.20211001.oa7
O. Popova, B. Popov, V. Karandey, V. Afanasyev
Today, effective management of information requires an in-depth study of its internal organization. The structural organization of information affects the efficiency of choosing a method for solving the problem and the qualitative presentation of information about the subject area. Therefore, the article proposes a new semiotic structural approach to assessing the structuredness of information in a subject area, as well as theoretical, practical, and general logical methods for studying the process of search research as a single system. The authors proposed and investigated the structured information coeffi-cient, which the authors propose to consider in several aspects - with respect to the search research model presented by the traditional algorithm, and the structured subject area. The article presents theo-retical positions, derives the formula of coefficients for different cases, carries out calculations on the example of the subject area “optimization methods”, constructs graphs based on the calculated data, and draws conclusions.
{"title":"Obtaining the Dynamic Coefficients of Structuredness for Assessing a Domain","authors":"O. Popova, B. Popov, V. Karandey, V. Afanasyev","doi":"10.4018/ijcini.20211001.oa7","DOIUrl":"https://doi.org/10.4018/ijcini.20211001.oa7","url":null,"abstract":"Today, effective management of information requires an in-depth study of its internal organization. The structural organization of information affects the efficiency of choosing a method for solving the problem and the qualitative presentation of information about the subject area. Therefore, the article proposes a new semiotic structural approach to assessing the structuredness of information in a subject area, as well as theoretical, practical, and general logical methods for studying the process of search research as a single system. The authors proposed and investigated the structured information coeffi-cient, which the authors propose to consider in several aspects - with respect to the search research model presented by the traditional algorithm, and the structured subject area. The article presents theo-retical positions, derives the formula of coefficients for different cases, carries out calculations on the example of the subject area “optimization methods”, constructs graphs based on the calculated data, and draws conclusions.","PeriodicalId":43637,"journal":{"name":"International Journal of Cognitive Informatics and Natural Intelligence","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81645488","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-01DOI: 10.4018/IJCINI.20211001.OA35
Vishal Vishnoi, S. Tiwari, R. Singla
{"title":"Controller Design for Temperature Control of MISO Water Tank System: Simulation Studies","authors":"Vishal Vishnoi, S. Tiwari, R. Singla","doi":"10.4018/IJCINI.20211001.OA35","DOIUrl":"https://doi.org/10.4018/IJCINI.20211001.OA35","url":null,"abstract":"","PeriodicalId":43637,"journal":{"name":"International Journal of Cognitive Informatics and Natural Intelligence","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83810529","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
To overcome the shortcomings of the standard particle swarm optimization algorithm (PSO), such as premature convergence and low precision, a dynamic multi-swarm PSO with global detection mechanism (DMS-PSO-GD) is proposed. In DMS-PSO-GD, the whole population is divided into two kinds of sub-swarms: several same-sized dynamic sub-swarms and a global sub-swarm. The dynamic sub-swarms achieve information interaction and sharing among themselves through the randomly regrouping strategy. The global sub-swarm evolves independently and learns from the optimal individuals of the dynamic sub-swarm with dominant characteristics. During the evolution process of the population, the variances and average fitness values of dynamic sub-swarms are used for measuring the distribution of the particles, by which the dominant one and the optimal individual can be detected easily. The comparison results among DMS-PSO-GD and other 5 well-known algorithms suggest that it demonstrates superior performance for solving different types of functions.
{"title":"A Dynamic Multi-Swarm Particle Swarm Optimization With Global Detection Mechanism","authors":"Bo Wei, Yichao Tang, Xiao Jin, Mingfeng Jiang, Zuohua Ding, Yanrong Huang","doi":"10.4018/ijcini.294566","DOIUrl":"https://doi.org/10.4018/ijcini.294566","url":null,"abstract":"To overcome the shortcomings of the standard particle swarm optimization algorithm (PSO), such as premature convergence and low precision, a dynamic multi-swarm PSO with global detection mechanism (DMS-PSO-GD) is proposed. In DMS-PSO-GD, the whole population is divided into two kinds of sub-swarms: several same-sized dynamic sub-swarms and a global sub-swarm. The dynamic sub-swarms achieve information interaction and sharing among themselves through the randomly regrouping strategy. The global sub-swarm evolves independently and learns from the optimal individuals of the dynamic sub-swarm with dominant characteristics. During the evolution process of the population, the variances and average fitness values of dynamic sub-swarms are used for measuring the distribution of the particles, by which the dominant one and the optimal individual can be detected easily. The comparison results among DMS-PSO-GD and other 5 well-known algorithms suggest that it demonstrates superior performance for solving different types of functions.","PeriodicalId":43637,"journal":{"name":"International Journal of Cognitive Informatics and Natural Intelligence","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81126710","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-01DOI: 10.4018/ijcini.20211001.oa5
Arnab MITRA
Enhanced data security and privacy are one of the major concerns in today’s digital society. The role of Primes towards the enhancements of data security and privacy is undeniable. Though several prime generations were presented, yet a cost effective and an easy to implement generation of Prime sequence should always have an advantage targeting real life applications. Hence, prime sequence generation using Cellular Automata (CA) is presented in this article as CA based modelling are easy to implement at the cost of flip-flops. The main contribution of this research is to explore the natural sequence of primes (i.e., primes A000040) with a special class of group CA, at fixed boundary environment; which may potentially be used as a Prime source towards the enhancements of data security and privacy. Experimental results confirm that the first 50 members of A000040 series may be explored at automata size 8 only. Detailed investigations towards the CA configuration and its dynamics in view of the generation of prime A000040 sequence, are also presented in this article.
{"title":"On the Exploration of the Natural Sequence of Primes With Cellular Automata Targeting Enhanced Data Security and Privacy","authors":"Arnab MITRA","doi":"10.4018/ijcini.20211001.oa5","DOIUrl":"https://doi.org/10.4018/ijcini.20211001.oa5","url":null,"abstract":"Enhanced data security and privacy are one of the major concerns in today’s digital society. The role of Primes towards the enhancements of data security and privacy is undeniable. Though several prime generations were presented, yet a cost effective and an easy to implement generation of Prime sequence should always have an advantage targeting real life applications. Hence, prime sequence generation using Cellular Automata (CA) is presented in this article as CA based modelling are easy to implement at the cost of flip-flops. The main contribution of this research is to explore the natural sequence of primes (i.e., primes A000040) with a special class of group CA, at fixed boundary environment; which may potentially be used as a Prime source towards the enhancements of data security and privacy. Experimental results confirm that the first 50 members of A000040 series may be explored at automata size 8 only. Detailed investigations towards the CA configuration and its dynamics in view of the generation of prime A000040 sequence, are also presented in this article.","PeriodicalId":43637,"journal":{"name":"International Journal of Cognitive Informatics and Natural Intelligence","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82373099","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-01DOI: 10.4018/IJCINI.20211001.OA39
Nagaraju Devarakonda, Ravi Kumar Saidala, Raviteja Kamarajugadda
In data analysis applications for extraction of useful knowledge, clustering plays an important role. The major shortcoming of traditional clustering algorithms is exhibiting poor performance in solving complex data cluster problems. This research paper introduces a novel hybrid optimization technique-based clustering approach. This paper is designed with two main objectives: designing efficient function optimization algorithm and developing advanced data clustering approach. In achieving the first objective, the standard TOA is first enhanced by hybridizing with Lévy flight trajectory and benchmarked on 23 functions. A new clustering approach is developed by conjoining k-means algorithm and Lévy flight TOA. The numerical complexity of the proposed novel clustering approach was tested on 10 UCI clustering datasets and four web document cluster problems. Several simulation experiments were conducted and an analysis of the results was done. The obtained graphical and statistical analysis reveals that the proposed novel clustering approach yields better quality clusters. based hybrid TOA for solving global function optimization problems as well as different data cluster problems. From the simulation experiments and analysis the proposed clustering approach is a suitable addition to clustering domains for solving complex data clustering problems. The NFL theorem logically proved that there is not any single optimization technique existed that can solve all sorts of optimization problems. In this work Lévy flight trajectory algorithm was used to enhance the standard TOA. In future work, other performance boosting up methods can be investigated. The future research also can development of new and novel nature-inspired Metaheuristics.
{"title":"A Hybrid Between TOA and Lévy Flight Trajectory for Solving Different Cluster Problems","authors":"Nagaraju Devarakonda, Ravi Kumar Saidala, Raviteja Kamarajugadda","doi":"10.4018/IJCINI.20211001.OA39","DOIUrl":"https://doi.org/10.4018/IJCINI.20211001.OA39","url":null,"abstract":"In data analysis applications for extraction of useful knowledge, clustering plays an important role. The major shortcoming of traditional clustering algorithms is exhibiting poor performance in solving complex data cluster problems. This research paper introduces a novel hybrid optimization technique-based clustering approach. This paper is designed with two main objectives: designing efficient function optimization algorithm and developing advanced data clustering approach. In achieving the first objective, the standard TOA is first enhanced by hybridizing with Lévy flight trajectory and benchmarked on 23 functions. A new clustering approach is developed by conjoining k-means algorithm and Lévy flight TOA. The numerical complexity of the proposed novel clustering approach was tested on 10 UCI clustering datasets and four web document cluster problems. Several simulation experiments were conducted and an analysis of the results was done. The obtained graphical and statistical analysis reveals that the proposed novel clustering approach yields better quality clusters. based hybrid TOA for solving global function optimization problems as well as different data cluster problems. From the simulation experiments and analysis the proposed clustering approach is a suitable addition to clustering domains for solving complex data clustering problems. The NFL theorem logically proved that there is not any single optimization technique existed that can solve all sorts of optimization problems. In this work Lévy flight trajectory algorithm was used to enhance the standard TOA. In future work, other performance boosting up methods can be investigated. The future research also can development of new and novel nature-inspired Metaheuristics.","PeriodicalId":43637,"journal":{"name":"International Journal of Cognitive Informatics and Natural Intelligence","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87498113","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-01DOI: 10.4018/IJCINI.20211001.OA41
R. Lebsir, Abdesslem Layeb, F. Tahi
This paper presents a strategy to tackle the multiple sequence alignment (MSA) problem, which is one of the most important tasks in the biological sequence analysis. Its role is to align the sequences in their entirety to derive relationships and common characteristics between a set of protein or nucleotide sequences. The MSA problem was proved to be an NP-Hard problem. The proposed strategy incorporates a new idea based on the well-known divide-and-conquer paradigm. This paper presents a novel method of clustering sequences as a preliminary step to improve the final alignment; this decomposition can be used as an optimization procedure with any MSA aligner to explore promising alignments of the search space. In their solution, the authors proposed to align the clusters in a parallel and distributed way in order to benefit from parallel architectures. The strategy was tested using classical benchmarks like BAliBASE, Sabre, Prefab4, and Oxm, and the experimental results show that it gives good results by comparing to the other aligners.
{"title":"A Greedy Clustering Algorithm for Multiple Sequence Alignment","authors":"R. Lebsir, Abdesslem Layeb, F. Tahi","doi":"10.4018/IJCINI.20211001.OA41","DOIUrl":"https://doi.org/10.4018/IJCINI.20211001.OA41","url":null,"abstract":"This paper presents a strategy to tackle the multiple sequence alignment (MSA) problem, which is one of the most important tasks in the biological sequence analysis. Its role is to align the sequences in their entirety to derive relationships and common characteristics between a set of protein or nucleotide sequences. The MSA problem was proved to be an NP-Hard problem. The proposed strategy incorporates a new idea based on the well-known divide-and-conquer paradigm. This paper presents a novel method of clustering sequences as a preliminary step to improve the final alignment; this decomposition can be used as an optimization procedure with any MSA aligner to explore promising alignments of the search space. In their solution, the authors proposed to align the clusters in a parallel and distributed way in order to benefit from parallel architectures. The strategy was tested using classical benchmarks like BAliBASE, Sabre, Prefab4, and Oxm, and the experimental results show that it gives good results by comparing to the other aligners.","PeriodicalId":43637,"journal":{"name":"International Journal of Cognitive Informatics and Natural Intelligence","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75927404","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-01DOI: 10.4018/ijcini.20211001.oa14
Kai Wang, Shasha Lv, Yongzhen Ke, Jing Guo, Rui Wang
Image aesthetic quality assessment has been a hot research topic in the field of image analysis during the last decade. Most recently, people have proposed comment type assessment to describe the aesthetics of an image using text automatically. However, existing works have rarely considered the quality of the aesthetic description. In this work, we propose a novel neural image aesthetic description network framework, named Deep Image Aesthetic Reviewer (DIAReviewer), based on Semantic Addition Transformer Model, the learning of Residual Network, and the Attention Mechanism in a single framework. Beyond that, we design a Semantic Addition module to compromise the image feature and semantic information to focus on the comment quality, such as fluency and complexity. We introduce a new image dataset named Aesthetic Review Dataset (ARD), which contains one or more aesthetic comments for each image. Finally, the experimental results on ARD show that our model outperforms other methods in content complexity and sentence fluency of aesthetic descriptions.
{"title":"Image Aesthetic Description Based on Semantic Addition Transformer Model","authors":"Kai Wang, Shasha Lv, Yongzhen Ke, Jing Guo, Rui Wang","doi":"10.4018/ijcini.20211001.oa14","DOIUrl":"https://doi.org/10.4018/ijcini.20211001.oa14","url":null,"abstract":"Image aesthetic quality assessment has been a hot research topic in the field of image analysis during the last decade. Most recently, people have proposed comment type assessment to describe the aesthetics of an image using text automatically. However, existing works have rarely considered the quality of the aesthetic description. In this work, we propose a novel neural image aesthetic description network framework, named Deep Image Aesthetic Reviewer (DIAReviewer), based on Semantic Addition Transformer Model, the learning of Residual Network, and the Attention Mechanism in a single framework. Beyond that, we design a Semantic Addition module to compromise the image feature and semantic information to focus on the comment quality, such as fluency and complexity. We introduce a new image dataset named Aesthetic Review Dataset (ARD), which contains one or more aesthetic comments for each image. Finally, the experimental results on ARD show that our model outperforms other methods in content complexity and sentence fluency of aesthetic descriptions.","PeriodicalId":43637,"journal":{"name":"International Journal of Cognitive Informatics and Natural Intelligence","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89565745","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：