首页 > 最新文献

International Journal of Cognitive Informatics and Natural Intelligence最新文献

英文 中文
Violence Detection With Two-Stream Neural Network Based on C3D 基于C3D的双流神经网络暴力检测
IF 0.9 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2021-10-01 DOI: 10.4018/ijcini.287601
zanzan Lu, Xu Xia, Hongrun Wu, Chen Yang
In recent years, violence detection has gradually turned into an important research area in computer vision, and have proposed many models with high accuracy. However, the unsatisfactory generalization ability of these methods over different datasets. In this paper, the authors propose a violence detection method based on C3D two-stream network for spatiotemporal features. Firstly, the authors preprocess the video data of RGB stream and optical stream respectively. Secondly, the authors feed the data into two C3D networks to extract features from the RGB flow and the optical flow respectively. Third, the authors fuse the features extracted by the two networks to obtain a final prediction result. To testify the performance of the proposed model, four different datasets (two public datasets and two self-built datasets) are selected in this paper. The experimental results show that our model has good generalization ability compared to state-of-the-art methods, since it not only has good ability on large-scale datasets, but also performs well on small-scale datasets.
近年来,暴力检测逐渐成为计算机视觉的一个重要研究领域,并提出了许多精度较高的模型。然而,这些方法在不同数据集上的泛化能力并不理想。本文提出了一种基于C3D双流网络的时空特征暴力检测方法。首先,分别对RGB流和光流视频数据进行预处理。其次,将数据输入到两个C3D网络中,分别从RGB流和光流中提取特征;第三,将两种网络提取的特征进行融合,得到最终的预测结果。为了验证该模型的性能,本文选择了四个不同的数据集(两个公共数据集和两个自建数据集)。实验结果表明,与现有方法相比,我们的模型具有良好的泛化能力,不仅在大规模数据集上具有良好的泛化能力,而且在小规模数据集上也表现良好。
{"title":"Violence Detection With Two-Stream Neural Network Based on C3D","authors":"zanzan Lu, Xu Xia, Hongrun Wu, Chen Yang","doi":"10.4018/ijcini.287601","DOIUrl":"https://doi.org/10.4018/ijcini.287601","url":null,"abstract":"In recent years, violence detection has gradually turned into an important research area in computer vision, and have proposed many models with high accuracy. However, the unsatisfactory generalization ability of these methods over different datasets. In this paper, the authors propose a violence detection method based on C3D two-stream network for spatiotemporal features. Firstly, the authors preprocess the video data of RGB stream and optical stream respectively. Secondly, the authors feed the data into two C3D networks to extract features from the RGB flow and the optical flow respectively. Third, the authors fuse the features extracted by the two networks to obtain a final prediction result. To testify the performance of the proposed model, four different datasets (two public datasets and two self-built datasets) are selected in this paper. The experimental results show that our model has good generalization ability compared to state-of-the-art methods, since it not only has good ability on large-scale datasets, but also performs well on small-scale datasets.","PeriodicalId":43637,"journal":{"name":"International Journal of Cognitive Informatics and Natural Intelligence","volume":"108 1","pages":"1-17"},"PeriodicalIF":0.9,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90677909","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}
引用次数: 1
A Hybrid Between TOA and Lévy Flight Trajectory for Solving Different Cluster Problems 混合TOA和lsamvy飞行轨迹求解不同集群问题
IF 0.9 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2021-10-01 DOI: 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.
在数据分析应用中提取有用的知识,聚类起着重要的作用。传统聚类算法的主要缺点是在解决复杂数据聚类问题时表现出较差的性能。本文介绍了一种新的基于混合优化技术的聚类方法。本文设计的两个主要目标是:设计高效的函数优化算法和开发先进的数据聚类方法。在实现第一个目标时,首先通过与lsamvy飞行轨迹杂交来增强标准TOA,并对23个函数进行基准测试。将k-means算法与lsamvy飞行TOA算法相结合,提出了一种新的聚类方法。在10个UCI聚类数据集和4个web文档聚类问题上测试了该聚类方法的数值复杂度。进行了多次仿真实验,并对实验结果进行了分析。得到的图形和统计分析表明,提出的新聚类方法产生了更高质量的聚类。基于混合TOA的全局函数优化问题以及不同的数据簇问题。从仿真实验和分析来看,本文提出的聚类方法是对聚类域的一种合适的补充,可以解决复杂的数据聚类问题。NFL定理从逻辑上证明了不存在一种能够解决所有优化问题的单一优化技术。本文采用lsamvy飞行轨迹算法来提高标准TOA。在今后的工作中,可以研究其他性能提升方法。未来的研究还可以开发新的和新颖的自然启发的元启发式。
{"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":"3 1","pages":"1-25"},"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}
引用次数: 2
A Classification Framework of Identifying Major Documents With Search Engine Suggestions and Unsupervised Subtopic Clustering 基于搜索引擎建议和无监督子主题聚类的主要文档识别分类框架
IF 0.9 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2021-10-01 DOI: 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.
本文解决了从一组类似的文档中自动识别出偏离主题的文档的问题,这些文档被认为是关于某个共同主题的。目标是从集合中去除噪声文件。针对非主题文档的发现问题,提出了一个基于主题模型的分类框架。本文引入了注释{it搜索引擎建议}的新概念,其中本文采用用于搜索页面的任何搜索查询作为该页内容的表示。本文采用词嵌入的方法对词和文档进行分布式表示,并对搜索引擎建议进行相似度比较。研究表明,搜索引擎建议可以是文本内容的高度精确的语义表示,并证明我们的文档分析算法使用这种表示进行相关性度量,与主题概率排序的基线技术相比,在主题内容过滤方面具有令人满意的性能。
{"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":"3 1","pages":"1-15"},"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}
引用次数: 0
Controller Design for Temperature Control of MISO Water Tank System: Simulation Studies MISO水箱系统温度控制控制器设计:仿真研究
IF 0.9 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2021-10-01 DOI: 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":"75 1","pages":"1-13"},"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}
引用次数: 3
On the Exploration of the Natural Sequence of Primes With Cellular Automata Targeting Enhanced Data Security and Privacy 以增强数据安全和隐私为目标的元胞自动机素数自然序列探索
IF 0.9 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2021-10-01 DOI: 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.
增强数据安全和隐私是当今数字社会的主要关注点之一。prime在增强数据安全和隐私方面的作用是不可否认的。虽然提出了几个素数代,但一个经济有效且易于实现的生成素数序列应该始终具有针对现实生活应用的优势。因此,本文提出了使用元胞自动机(CA)生成素数序列,因为基于CA的建模易于实现,但代价是触发器。本研究的主要贡献在于探讨了在固定边界环境下具有特殊类群CA的素数(即素数A000040)的自然序列;这可能会成为增强数据安全和隐私的主要来源。实验结果证实,A000040系列的前50个成员可能只在自动机大小为8时进行探索。本文还针对A000040素数序列的生成,对CA结构及其动力学进行了详细的研究。
{"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":"57 1","pages":"1-18"},"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}
引用次数: 0
Image Aesthetic Description Based on Semantic Addition Transformer Model 基于语义加法变换模型的图像美学描述
IF 0.9 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2021-10-01 DOI: 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.
近十年来,图像美学质量评价一直是图像分析领域的研究热点。最近,人们提出了使用文本自动描述图像美学的评论类型评估。然而,现有的作品很少考虑到审美描写的质量。在这项工作中,我们提出了一个新的神经图像美学描述网络框架,称为深度图像美学评论家(DIAReviewer),基于语义加法变换模型,残差网络的学习和注意机制在一个单一的框架。除此之外,我们还设计了一个语义添加模块,以折衷图像特征和语义信息,以关注评论的质量,如流畅性和复杂性。我们引入了一个新的图像数据集,名为美学评论数据集(ARD),它包含每个图像的一个或多个美学评论。最后,在ARD上的实验结果表明,我们的模型在美学描述的内容复杂性和句子流畅性方面优于其他方法。
{"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":"34 1","pages":"1-14"},"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}
引用次数: 0
A Dynamic Multi-Swarm Particle Swarm Optimization With Global Detection Mechanism 具有全局检测机制的动态多群粒子群优化
IF 0.9 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2021-10-01 DOI: 10.4018/ijcini.294566
Bo Wei, Yichao Tang, Xiao Jin, Mingfeng Jiang, Zuohua Ding, Yanrong Huang
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.
针对标准粒子群优化算法(PSO)过早收敛、精度低等缺点,提出了一种具有全局检测机制的动态多群粒子群优化算法(DMS-PSO-GD)。在DMS-PSO-GD算法中,整个种群被划分为两种类型的子群:几个相同大小的动态子群和一个全局子群。动态子群通过随机重组策略实现信息交互和共享。全局子群独立进化,向具有优势特征的动态子群的最优个体学习。在种群进化过程中,利用动态子群的方差和平均适应度值来衡量粒子的分布,从而方便地检测出优势个体和最优个体。DMS-PSO-GD算法与其他5种知名算法的比较结果表明,DMS-PSO-GD算法在求解不同类型的函数时表现出优异的性能。
{"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":"52 1","pages":"1-23"},"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}
引用次数: 1
Obtaining the Dynamic Coefficients of Structuredness for Assessing a Domain 获取评估领域的动态结构化系数
IF 0.9 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2021-10-01 DOI: 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":"24 1","pages":"1-24"},"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}
引用次数: 0
MapReduce-Based Crow Search-Adopted Partitional Clustering Algorithms for Handling Large-Scale Data 基于mapreduce的乌鸦搜索-采用分区聚类算法处理大规模数据
IF 0.9 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2021-10-01 DOI: 10.4018/IJCINI.20211001.OA32
N. Visalakshi, S. Shanthi, K. Lakshmi
{"title":"MapReduce-Based Crow Search-Adopted Partitional Clustering Algorithms for Handling Large-Scale Data","authors":"N. Visalakshi, S. Shanthi, K. Lakshmi","doi":"10.4018/IJCINI.20211001.OA32","DOIUrl":"https://doi.org/10.4018/IJCINI.20211001.OA32","url":null,"abstract":"","PeriodicalId":43637,"journal":{"name":"International Journal of Cognitive Informatics and Natural Intelligence","volume":"2 1","pages":"1-23"},"PeriodicalIF":0.9,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74551018","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}
引用次数: 1
Convolutional Neural Network Integrated With Fuzzy Rules for Decision Making in Brain Tumor Diagnosis 结合模糊规则的卷积神经网络在脑肿瘤诊断中的应用
IF 0.9 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2021-10-01 DOI: 10.4018/ijcini.20211001.oa47
Pham Van Hai, Eloanyi Samson Amaechi
Conventional methods used in brain tumors detection, diagnosis, and classification such as magnetic resonance imaging and computed tomography scanning technologies are unbridged in their results. This paper presents a proposed model combination, convolutional neural networks with fuzzy rules in the detection and classification of medical imaging such as healthy brain cell and tumors brain cells. This model contributes fully on the automatic classification and detection medical imaging such as brain tumors, heart diseases, breast cancers, HIV and FLU. The experimental result of the proposed model shows overall accuracy of 97.6%, which indicates that the proposed method achieves improved performance than the other current methods in the literature such as [classification of tumors in human brain MRI using wavelet and support vector machine 94.7%, and deep convolutional neural networks with transfer learning for automated brain image classification 95.0%], uses in the detection, diagnosis, and classification of medical imaging decision supports.
传统的脑肿瘤检测、诊断和分类方法,如磁共振成像和计算机断层扫描技术,在其结果上是没有桥梁的。本文提出了一种基于模糊规则的卷积神经网络对健康脑细胞和肿瘤脑细胞等医学影像进行检测和分类的方法。该模型在脑肿瘤、心脏病、乳腺癌、艾滋病、流感等医学影像的自动分类和检测方面发挥了重要作用。实验结果表明,该模型的总体准确率为97.6%,与文献中现有的[基于小波和支持向量机的人脑MRI肿瘤分类94.7%,基于迁移学习的深度卷积神经网络用于脑图像自动分类95.0%]等方法相比,该方法的性能有所提高。并为医学影像分类决策提供支持。
{"title":"Convolutional Neural Network Integrated With Fuzzy Rules for Decision Making in Brain Tumor Diagnosis","authors":"Pham Van Hai, Eloanyi Samson Amaechi","doi":"10.4018/ijcini.20211001.oa47","DOIUrl":"https://doi.org/10.4018/ijcini.20211001.oa47","url":null,"abstract":"Conventional methods used in brain tumors detection, diagnosis, and classification such as magnetic resonance imaging and computed tomography scanning technologies are unbridged in their results. This paper presents a proposed model combination, convolutional neural networks with fuzzy rules in the detection and classification of medical imaging such as healthy brain cell and tumors brain cells. This model contributes fully on the automatic classification and detection medical imaging such as brain tumors, heart diseases, breast cancers, HIV and FLU. The experimental result of the proposed model shows overall accuracy of 97.6%, which indicates that the proposed method achieves improved performance than the other current methods in the literature such as [classification of tumors in human brain MRI using wavelet and support vector machine 94.7%, and deep convolutional neural networks with transfer learning for automated brain image classification 95.0%], uses in the detection, diagnosis, and classification of medical imaging decision supports.","PeriodicalId":43637,"journal":{"name":"International Journal of Cognitive Informatics and Natural Intelligence","volume":"93 1","pages":"1-23"},"PeriodicalIF":0.9,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74900621","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}
引用次数: 1
期刊
International Journal of Cognitive Informatics and Natural Intelligence
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1