首页 > 最新文献

2020 Fourth International Conference on Computing Methodologies and Communication (ICCMC)最新文献

英文 中文
Clustering Evaluation by Davies-Bouldin Index(DBI) in Cereal data using K-Means 基于K-Means的谷物数据davis - bouldin指数聚类评价
Pub Date : 2020-03-01 DOI: 10.1109/ICCMC48092.2020.ICCMC-00057
Akhilesh Kumar Singh, Shantanu Mittal, P. Malhotra, Yash Srivastava
Cereals grains have been used as a principle ingredient of human diet for hundreds of years. Indian cereal crops provide vital nutrients and energy to the human diet. The motivation behind this research paper is to distribute the research discoveries of applying K-Means clustering, on a cereal dataset and to differentiate the outcomes found on the number of bunches to identify whether the ideal or best number of groups to be 3 or 5. This speculation is achieved by applying distinctive clustering tests (likewise reordered in the paper), and visualizations. The aforementioned resolution by doing exploratory analysis, at that point modeled fitting followed by result testing, driving us to a definite end. The language utilized for our exploration is R.
谷物作为人类饮食的主要成分已有数百年的历史。印度谷类作物为人类饮食提供重要的营养和能量。本研究论文背后的动机是在谷物数据集上分发应用K-Means聚类的研究发现,并区分在束数上发现的结果,以确定理想或最佳的组数是3还是5。这种推测是通过应用独特的聚类测试(同样在本文中重新排序)和可视化来实现的。上述解决方案通过探索性的分析,在模型拟合之后进行结果测试,将我们推向明确的终点。我们的探索使用的语言是R。
{"title":"Clustering Evaluation by Davies-Bouldin Index(DBI) in Cereal data using K-Means","authors":"Akhilesh Kumar Singh, Shantanu Mittal, P. Malhotra, Yash Srivastava","doi":"10.1109/ICCMC48092.2020.ICCMC-00057","DOIUrl":"https://doi.org/10.1109/ICCMC48092.2020.ICCMC-00057","url":null,"abstract":"Cereals grains have been used as a principle ingredient of human diet for hundreds of years. Indian cereal crops provide vital nutrients and energy to the human diet. The motivation behind this research paper is to distribute the research discoveries of applying K-Means clustering, on a cereal dataset and to differentiate the outcomes found on the number of bunches to identify whether the ideal or best number of groups to be 3 or 5. This speculation is achieved by applying distinctive clustering tests (likewise reordered in the paper), and visualizations. The aforementioned resolution by doing exploratory analysis, at that point modeled fitting followed by result testing, driving us to a definite end. The language utilized for our exploration is R.","PeriodicalId":130581,"journal":{"name":"2020 Fourth International Conference on Computing Methodologies and Communication (ICCMC)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126552238","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}
引用次数: 31
Image Mining Methodology for Detection of Brain Tumor: A Review 脑肿瘤检测的图像挖掘方法综述
Pub Date : 2020-03-01 DOI: 10.1109/ICCMC48092.2020.ICCMC-00044
Shinde Swapnil, V. Girish
A human brain contains number of tissues that relate to achieving proper functioning of brain. Meanwhile, any abnormal growth in these tissues may change the functioning and this is generally referred as brain tumor. Brain tumor is mainly of two types low grade or benign (Grade 1 and Grade 2) and high grade or malignant (Grade 3 and Grade 4). Brain tumor can be detected with MRI images by applying image processing steps and some machine learning algorithms. Brain MRI images undergo processing by using different techniques such as image enhancement, clustering and classification for detecting the level of brain tumor. The study shows that the filtering operations, edge detection algorithms, morphological operations and clustering are some of the important steps employed for detecting the various levels of brain tumor. This paper mainly focuses on preparing the comparison review on the basis of the referenced proposed methodology, feature extraction and classification methods with its results, future scope along with the advantages and disadvantages of the research done by different professionals and compiling it into one paper. This helps to provide scope for future research directions in brain tumor classification.
人的大脑包含许多组织,这些组织与大脑的正常功能有关。同时,这些组织的任何异常生长都可能改变其功能,这通常被称为脑肿瘤。脑肿瘤主要分为低级别或良性(1级和2级)和高级别或恶性(3级和4级)两种类型。通过应用图像处理步骤和一些机器学习算法,可以通过MRI图像检测到脑肿瘤。脑MRI图像通过图像增强、聚类和分类等不同的技术进行处理,以检测脑肿瘤的水平。研究表明,滤波运算、边缘检测算法、形态学运算和聚类是检测不同程度脑肿瘤的重要步骤。本文主要是在参考提出的方法、特征提取和分类方法及其结果、未来范围以及不同专业研究的优缺点的基础上,准备比较综述,并将其汇编成一篇论文。这有助于为今后脑肿瘤分类的研究方向提供空间。
{"title":"Image Mining Methodology for Detection of Brain Tumor: A Review","authors":"Shinde Swapnil, V. Girish","doi":"10.1109/ICCMC48092.2020.ICCMC-00044","DOIUrl":"https://doi.org/10.1109/ICCMC48092.2020.ICCMC-00044","url":null,"abstract":"A human brain contains number of tissues that relate to achieving proper functioning of brain. Meanwhile, any abnormal growth in these tissues may change the functioning and this is generally referred as brain tumor. Brain tumor is mainly of two types low grade or benign (Grade 1 and Grade 2) and high grade or malignant (Grade 3 and Grade 4). Brain tumor can be detected with MRI images by applying image processing steps and some machine learning algorithms. Brain MRI images undergo processing by using different techniques such as image enhancement, clustering and classification for detecting the level of brain tumor. The study shows that the filtering operations, edge detection algorithms, morphological operations and clustering are some of the important steps employed for detecting the various levels of brain tumor. This paper mainly focuses on preparing the comparison review on the basis of the referenced proposed methodology, feature extraction and classification methods with its results, future scope along with the advantages and disadvantages of the research done by different professionals and compiling it into one paper. This helps to provide scope for future research directions in brain tumor classification.","PeriodicalId":130581,"journal":{"name":"2020 Fourth International Conference on Computing Methodologies and Communication (ICCMC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126818230","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}
引用次数: 5
Detection of Brain Tumor Using Image Processing 利用图像处理技术检测脑肿瘤
Pub Date : 2020-03-01 DOI: 10.1109/ICCMC48092.2020.ICCMC-000156
D. Suresha, N. Jagadisha, H. Shrisha, K. Kaushik
Brain tumor is an accumulation of anomalous tissue in the brain. Tumors are primarily classified into malignant and benign when they develop. It can be life threatening hence it is important to recognize and identify the presence of tumors in brain image. This paper proposes a system to decide whether the brain has tumor or is it tumor-free from the MR image using combined technique of K-Means and support vector machine. In the first stage the input image is converted to grey scale using binary thresholding and the spots are detected. The recognized spots are represented in terms of their intensities to distinguish between the normal and tumor brain. The set of feature extracted are later characterized by using K-Means algorithm, then the tumor recognition is done using support vector machine.
脑肿瘤是脑内异常组织的堆积。肿瘤在发生时主要分为恶性和良性。它可能危及生命,因此在脑图像中识别和识别肿瘤的存在是很重要的。本文提出了一种基于k -均值和支持向量机相结合的脑磁共振图像肿瘤诊断系统。在第一阶段使用二值阈值将输入图像转换为灰度并检测斑点。识别的斑点以其强度表示,以区分正常和肿瘤脑。对提取的特征集使用K-Means算法进行特征化,然后使用支持向量机进行肿瘤识别。
{"title":"Detection of Brain Tumor Using Image Processing","authors":"D. Suresha, N. Jagadisha, H. Shrisha, K. Kaushik","doi":"10.1109/ICCMC48092.2020.ICCMC-000156","DOIUrl":"https://doi.org/10.1109/ICCMC48092.2020.ICCMC-000156","url":null,"abstract":"Brain tumor is an accumulation of anomalous tissue in the brain. Tumors are primarily classified into malignant and benign when they develop. It can be life threatening hence it is important to recognize and identify the presence of tumors in brain image. This paper proposes a system to decide whether the brain has tumor or is it tumor-free from the MR image using combined technique of K-Means and support vector machine. In the first stage the input image is converted to grey scale using binary thresholding and the spots are detected. The recognized spots are represented in terms of their intensities to distinguish between the normal and tumor brain. The set of feature extracted are later characterized by using K-Means algorithm, then the tumor recognition is done using support vector machine.","PeriodicalId":130581,"journal":{"name":"2020 Fourth International Conference on Computing Methodologies and Communication (ICCMC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122697071","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}
引用次数: 17
A Review on Acute Lymphoblastic Leukemia Classification Based on Hybrid Low Level Features 基于杂交低水平特征的急性淋巴细胞白血病分类研究进展
Pub Date : 2020-03-01 DOI: 10.1109/ICCMC48092.2020.ICCMC-00031
Shivani Patel, S. Degadwala, A. Mahajan
leukemia region unit ordered likewise whichever myelogenous (also called myeloid) or white platelet contingent upon that sorts for the influenced white platelets region unit. Leukemia happens when that bone marrow produces adolescent white cells, Furthermore leukemia happen when the marrow produces full grown phones. Intense lymphocytic leukemia (ALL) might additionally make a structure of cancellous around that those bone marrow makes excessively awful huge numbers adolescent lymphocytes (a sensibly white blood cell). Threatening Growth ailment might potentially might want an impact looking into RBC, WBC, and platelets. Every last bit is the greater part commonplace clinched alongside childhood, with a top frequency at 2–5 a considerable length of time outdated and in turn top over adulthood. The arranged approach is assessed around 3public picture databases for totally completely different aspects. The further execution measures: accuracy, specificity, and affectability. Division will furthermore order about intense lymphocytic leukemia that is frequently completed by utilizing “manage taking in” methodology.
白血病区单位同样按受影响的白血小板区单位排序,无论哪个系(也称为髓系)或白血小板依该分类而定。当骨髓产生青少年白细胞时,白血病就发生了。此外,当骨髓产生完全成熟的细胞时,白血病就发生了。急性淋巴细胞白血病(ALL)还可能在骨髓周围形成一种松质结构,产生大量的青少年淋巴细胞(一种敏感的白细胞)。威胁性生长疾病可能会对红细胞,白细胞和血小板产生影响。每一个比特都是与童年紧密联系在一起的最常见的部分,最高频率在2-5岁,相当长的一段时间已经过时,反过来在成年期达到顶峰。该方法围绕3个公共图片数据库进行了完全不同方面的评估。进一步的执行措施:准确性、特异性和亲和性。科室将进一步对强性淋巴细胞白血病进行排序,通常采用“管理吸收”方法完成。
{"title":"A Review on Acute Lymphoblastic Leukemia Classification Based on Hybrid Low Level Features","authors":"Shivani Patel, S. Degadwala, A. Mahajan","doi":"10.1109/ICCMC48092.2020.ICCMC-00031","DOIUrl":"https://doi.org/10.1109/ICCMC48092.2020.ICCMC-00031","url":null,"abstract":"leukemia region unit ordered likewise whichever myelogenous (also called myeloid) or white platelet contingent upon that sorts for the influenced white platelets region unit. Leukemia happens when that bone marrow produces adolescent white cells, Furthermore leukemia happen when the marrow produces full grown phones. Intense lymphocytic leukemia (ALL) might additionally make a structure of cancellous around that those bone marrow makes excessively awful huge numbers adolescent lymphocytes (a sensibly white blood cell). Threatening Growth ailment might potentially might want an impact looking into RBC, WBC, and platelets. Every last bit is the greater part commonplace clinched alongside childhood, with a top frequency at 2–5 a considerable length of time outdated and in turn top over adulthood. The arranged approach is assessed around 3public picture databases for totally completely different aspects. The further execution measures: accuracy, specificity, and affectability. Division will furthermore order about intense lymphocytic leukemia that is frequently completed by utilizing “manage taking in” methodology.","PeriodicalId":130581,"journal":{"name":"2020 Fourth International Conference on Computing Methodologies and Communication (ICCMC)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123037861","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
Secured E-voting System Using Two-factor Biometric Authentication 使用双因素生物识别认证的安全电子投票系统
Pub Date : 2020-03-01 DOI: 10.1109/ICCMC48092.2020.ICCMC-00046
Sudeepthi Komatineni, Gowtham Lingala
Building a secure voting system that offers privacy of conventional voting system with proper voter authentication & transparency has been a challenge for a due course of time. The research work proposes a secured and robust electronic voting system based on popular machine learning based facial recognition algorithms and biometric authentication methodologies for the purpose of building a secure voting system. In particular, it focuses on the potential working of face detection and recognition and bio-metric authentication namely bio-metric scan, and the implementation procedure, which improves the security and decreases the duplicate vote and fraudulent to make the system as more efficient and user friendly in nature.
建立一个安全的投票系统,提供传统投票系统的隐私,适当的选民认证和透明度,一直是一个挑战。研究工作提出了一种基于流行的基于机器学习的人脸识别算法和生物特征认证方法的安全、稳健的电子投票系统,以构建安全的投票系统。重点介绍了人脸检测识别和生物特征认证即生物特征扫描的潜在工作原理,以及实现过程,提高了安全性,减少了重复投票和欺诈,使系统更加高效和用户友好。
{"title":"Secured E-voting System Using Two-factor Biometric Authentication","authors":"Sudeepthi Komatineni, Gowtham Lingala","doi":"10.1109/ICCMC48092.2020.ICCMC-00046","DOIUrl":"https://doi.org/10.1109/ICCMC48092.2020.ICCMC-00046","url":null,"abstract":"Building a secure voting system that offers privacy of conventional voting system with proper voter authentication & transparency has been a challenge for a due course of time. The research work proposes a secured and robust electronic voting system based on popular machine learning based facial recognition algorithms and biometric authentication methodologies for the purpose of building a secure voting system. In particular, it focuses on the potential working of face detection and recognition and bio-metric authentication namely bio-metric scan, and the implementation procedure, which improves the security and decreases the duplicate vote and fraudulent to make the system as more efficient and user friendly in nature.","PeriodicalId":130581,"journal":{"name":"2020 Fourth International Conference on Computing Methodologies and Communication (ICCMC)","volume":"495 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127584441","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}
引用次数: 11
Improving Security Control of Text-Based CAPTCHA Challenges using Honeypot and Timestamping 使用蜜罐和时间戳改进基于文本的CAPTCHA挑战的安全控制
Pub Date : 2020-03-01 DOI: 10.1109/ICCMC48092.2020.ICCMC-000131
M. T. Banday, Shafiya Afzal Sheikh
The resistance to attacks aimed to break CAPTCHA challenges and the effectiveness, efficiency and satisfaction of human users in solving them called usability are the two major concerns while designing CAPTCHA schemes. User-friendliness, universality, and accessibility are related dimensions of usability, which must also be addressed adequately. With recent advances in segmentation and optical character recognition techniques, complex distortions, degradations and transformations are added to text-based CAPTCHA challenges resulting in their reduced usability. The extent of these deformations can be decreased if some additional security mechanism is incorporated in such challenges. This paper proposes an additional security mechanism that can add an extra layer of protection to any text-based CAPTCHA challenge, making it more challenging for bots and scripts that might be used to attack websites and web applications. It proposes the use of hidden text-boxes for user entry of CAPTCHA string which serves as honeypots for bots and automated scripts. The honeypot technique is used to trick bots and automated scripts into filling up input fields which legitimate human users cannot fill in. The paper reports implementation of honeypot technique and results of tests carried out over three months during which form submissions were logged for analysis. The results demonstrated great effectiveness of honeypots technique to improve security control and usability of text-based CAPTCHA challenges.
在设计CAPTCHA方案时,对旨在打破CAPTCHA挑战的攻击的抵抗力以及人类用户在解决这些挑战时的有效性、效率和满意度(称为可用性)是两个主要关注的问题。用户友好性、通用性和可访问性是可用性的相关方面,也必须充分加以处理。随着分割和光学字符识别技术的最新进展,复杂的扭曲、退化和转换被添加到基于文本的CAPTCHA挑战中,导致其可用性降低。如果在这些挑战中加入一些额外的安全机制,则可以减少这些变形的程度。本文提出了一种额外的安全机制,可以为任何基于文本的CAPTCHA挑战添加额外的保护层,使可能用于攻击网站和web应用程序的机器人和脚本更具挑战性。它建议使用隐藏文本框为用户输入CAPTCHA字符串,作为机器人和自动脚本的蜜罐。蜜罐技术用于欺骗机器人和自动脚本,使其填写合法用户无法填写的输入字段。本文报告了蜜罐技术的实施情况和三个月来进行的测试结果,在此期间记录了提交的表格以供分析。结果证明了蜜罐技术在提高基于文本的验证码挑战的安全性控制和可用性方面的巨大有效性。
{"title":"Improving Security Control of Text-Based CAPTCHA Challenges using Honeypot and Timestamping","authors":"M. T. Banday, Shafiya Afzal Sheikh","doi":"10.1109/ICCMC48092.2020.ICCMC-000131","DOIUrl":"https://doi.org/10.1109/ICCMC48092.2020.ICCMC-000131","url":null,"abstract":"The resistance to attacks aimed to break CAPTCHA challenges and the effectiveness, efficiency and satisfaction of human users in solving them called usability are the two major concerns while designing CAPTCHA schemes. User-friendliness, universality, and accessibility are related dimensions of usability, which must also be addressed adequately. With recent advances in segmentation and optical character recognition techniques, complex distortions, degradations and transformations are added to text-based CAPTCHA challenges resulting in their reduced usability. The extent of these deformations can be decreased if some additional security mechanism is incorporated in such challenges. This paper proposes an additional security mechanism that can add an extra layer of protection to any text-based CAPTCHA challenge, making it more challenging for bots and scripts that might be used to attack websites and web applications. It proposes the use of hidden text-boxes for user entry of CAPTCHA string which serves as honeypots for bots and automated scripts. The honeypot technique is used to trick bots and automated scripts into filling up input fields which legitimate human users cannot fill in. The paper reports implementation of honeypot technique and results of tests carried out over three months during which form submissions were logged for analysis. The results demonstrated great effectiveness of honeypots technique to improve security control and usability of text-based CAPTCHA challenges.","PeriodicalId":130581,"journal":{"name":"2020 Fourth International Conference on Computing Methodologies and Communication (ICCMC)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133951864","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 Study on Role of Machine Learning in Detectin Heart Diseas. 机器学习在心脏病检测中的作用研究。
Pub Date : 2020-03-01 DOI: 10.1109/ICCMC48092.2020.ICCMC-00037
P. Kaur
A fist size muscle occupies an important in the human body by supplying oxygen to all the body organs. According to study of demography from WHO (World Health organization), the main cause of increasing death rate is due to the cardiac failure of human being. The main challenge for data analysis is to predict and prevent the heart disease. Machine learning has been developed to perform impressive predictions and make appropriate decision from abundant data originated by healthcare centres. In this paper numerous machine learning techniques are surveyed by using the knowledge collected from preprocessing data (clinical knowledge), which comprises many medical features to perform heart disease detection. The comparative study states that the prediction of heart disease has been improved by combining various machine learning algorithms to perform early disease investigation in a cost effective manner. The proposed research work primarily focuses on preparing a review of the research done by different professionals and compiling it into one paper and creating a direction for future research in this domain. In this paper many techniques are surveyed where best predictions are performed for heart disease.
拳头大小的肌肉在人体中起着重要的作用,为人体所有器官提供氧气。根据世界卫生组织(WHO)的人口学研究,人类死亡率上升的主要原因是心力衰竭。数据分析的主要挑战是预测和预防心脏病。机器学习已经发展到可以执行令人印象深刻的预测,并从医疗中心提供的大量数据中做出适当的决策。本文研究了多种机器学习技术,利用从预处理数据(临床知识)中收集的知识来进行心脏病检测,这些数据包含许多医学特征。对比研究表明,通过结合各种机器学习算法,以经济有效的方式进行早期疾病调查,可以提高心脏病的预测。建议的研究工作主要集中在准备对不同专业人员所做的研究进行回顾,并将其汇编成一篇论文,并为该领域的未来研究创造方向。在这篇论文中,许多技术被调查,其中最好的预测进行了心脏疾病。
{"title":"A Study on Role of Machine Learning in Detectin Heart Diseas.","authors":"P. Kaur","doi":"10.1109/ICCMC48092.2020.ICCMC-00037","DOIUrl":"https://doi.org/10.1109/ICCMC48092.2020.ICCMC-00037","url":null,"abstract":"A fist size muscle occupies an important in the human body by supplying oxygen to all the body organs. According to study of demography from WHO (World Health organization), the main cause of increasing death rate is due to the cardiac failure of human being. The main challenge for data analysis is to predict and prevent the heart disease. Machine learning has been developed to perform impressive predictions and make appropriate decision from abundant data originated by healthcare centres. In this paper numerous machine learning techniques are surveyed by using the knowledge collected from preprocessing data (clinical knowledge), which comprises many medical features to perform heart disease detection. The comparative study states that the prediction of heart disease has been improved by combining various machine learning algorithms to perform early disease investigation in a cost effective manner. The proposed research work primarily focuses on preparing a review of the research done by different professionals and compiling it into one paper and creating a direction for future research in this domain. In this paper many techniques are surveyed where best predictions are performed for heart disease.","PeriodicalId":130581,"journal":{"name":"2020 Fourth International Conference on Computing Methodologies and Communication (ICCMC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133996321","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
Study of Wavelength Converter Placement in p(pre-configured)-Cycle Protection 波长转换器在p(预配置)周期保护中的放置研究
Pub Date : 2020-03-01 DOI: 10.1109/ICCMC48092.2020.ICCMC-00086
Vidhi Gupta, R. Asthana
The wavelength division multiplexed (WDM) networks can be efficiently protected with high speed using preconfigured protection cycles (p-cycles). p-Cycles can be introduced in any network with or without wavelength converters. As wavelength converters are costlier devices, fully equipping the networks with wavelength converters make it highly expensive. Thus we have compared the spare capacity, in terms of route km of fiber length required, for providing p-cycle protection by placing wavelength converters at some node positions. We have also introduced optimum position for placement of converters at high traversing (HT) nodes. By placing converters at these nodes the required spare capacity is least among all the cases studied.
波分复用(WDM)网络可以使用预配置的保护周期(p周期)进行高效的高速保护。p周期可以在任何有或没有波长转换器的网络中引入。由于波长转换器是更昂贵的设备,因此为网络完全配备波长转换器将使其变得非常昂贵。因此,我们比较了在某些节点位置放置波长转换器以提供p周期保护所需的光纤长度公里的备用容量。我们还介绍了在高穿越(HT)节点上放置转换器的最佳位置。通过在这些节点上放置转换器,所需的备用容量在所有研究案例中是最少的。
{"title":"Study of Wavelength Converter Placement in p(pre-configured)-Cycle Protection","authors":"Vidhi Gupta, R. Asthana","doi":"10.1109/ICCMC48092.2020.ICCMC-00086","DOIUrl":"https://doi.org/10.1109/ICCMC48092.2020.ICCMC-00086","url":null,"abstract":"The wavelength division multiplexed (WDM) networks can be efficiently protected with high speed using preconfigured protection cycles (p-cycles). p-Cycles can be introduced in any network with or without wavelength converters. As wavelength converters are costlier devices, fully equipping the networks with wavelength converters make it highly expensive. Thus we have compared the spare capacity, in terms of route km of fiber length required, for providing p-cycle protection by placing wavelength converters at some node positions. We have also introduced optimum position for placement of converters at high traversing (HT) nodes. By placing converters at these nodes the required spare capacity is least among all the cases studied.","PeriodicalId":130581,"journal":{"name":"2020 Fourth International Conference on Computing Methodologies and Communication (ICCMC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132132673","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
Comparative Study on Different Approaches in Keyword Extraction 关键词提取方法的比较研究
Pub Date : 2020-03-01 DOI: 10.1109/ICCMC48092.2020.ICCMC-00013
Edu Gopan, Sanjay Rajesh, Vishnu Gr, Akhil Raj R, M. Thushara
Since there is an increasing number of research documents published every year, the documents available on the Internet will also be increasing rapidly. This poses the need to categorize the available research articles into their respective domain to ease the search process and find their research documents under the specific domain. This classification is a tiresome and prolonged process, which can be avoided by using keywords and keyphrases. Keywords or keyphrases provides a summary or information described in a research document. The domain of a research paper can be determined based on extracted keywords and keyphrases. It is monotonous to manually extract keywords and key phrases [4]. Automatic extraction of keyword techniques helps to overcome this challenging task. The classification of these research papers can be achieved more efficiently by using the keywords applicable to a particular domain. This paper aims to compare key extraction algorithms such as TextRank, PositionRank, keyphrase extraction algorithm (KEA) and Multi-purpose automatic topic indexing (MAUI).
由于每年发表的研究文件数量不断增加,因此互联网上可获得的文件也将迅速增加。这就需要将可用的研究文章分类到各自的领域,以简化搜索过程,并在特定领域下找到他们的研究文件。这种分类是一个令人厌烦和冗长的过程,可以通过使用关键字和关键短语来避免。关键字或关键短语提供了研究文件中描述的摘要或信息。研究论文的领域可以根据提取的关键字和关键短语来确定。手工提取关键字和关键短语是单调的[4]。自动提取关键字技术有助于克服这一具有挑战性的任务。通过使用适用于特定领域的关键字,可以更有效地对这些研究论文进行分类。本文旨在比较TextRank、PositionRank、关键词提取算法(KEA)和多用途自动主题索引(MAUI)等关键提取算法。
{"title":"Comparative Study on Different Approaches in Keyword Extraction","authors":"Edu Gopan, Sanjay Rajesh, Vishnu Gr, Akhil Raj R, M. Thushara","doi":"10.1109/ICCMC48092.2020.ICCMC-00013","DOIUrl":"https://doi.org/10.1109/ICCMC48092.2020.ICCMC-00013","url":null,"abstract":"Since there is an increasing number of research documents published every year, the documents available on the Internet will also be increasing rapidly. This poses the need to categorize the available research articles into their respective domain to ease the search process and find their research documents under the specific domain. This classification is a tiresome and prolonged process, which can be avoided by using keywords and keyphrases. Keywords or keyphrases provides a summary or information described in a research document. The domain of a research paper can be determined based on extracted keywords and keyphrases. It is monotonous to manually extract keywords and key phrases [4]. Automatic extraction of keyword techniques helps to overcome this challenging task. The classification of these research papers can be achieved more efficiently by using the keywords applicable to a particular domain. This paper aims to compare key extraction algorithms such as TextRank, PositionRank, keyphrase extraction algorithm (KEA) and Multi-purpose automatic topic indexing (MAUI).","PeriodicalId":130581,"journal":{"name":"2020 Fourth International Conference on Computing Methodologies and Communication (ICCMC)","volume":"191 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114591566","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}
引用次数: 6
Sentimental Analysis (Opinion Mining) in Social Network by Using Svm Algorithm 基于Svm算法的社交网络情感分析(意见挖掘
Pub Date : 2020-03-01 DOI: 10.1109/ICCMC48092.2020.ICCMC-000159
T. Sathis Kumar, P. Mohamed Nabeem, C. K. Manoj, K. Jeyachandran
Web discussions are as often as possible utilized as stages for the trading of data and assessments just as publicity dispersal. The client produced content on the web develops quickly right now age. The transformative changes in innovation utilize such data to catch just the client’s substance lastly the valuable data are presented to data searchers. The majority of the current research on content data preparing, centers in the genuine area as opposed to the assessment space. Content mining assumes a fundamental job in online gathering feeling mining. Be that as it may, feeling mining from online discussion is significantly more troublesome than unadulterated content procedure because of their semi organized qualities. Order dependent on opinions has become another outskirts to content mining network. The assignment of assumption arrangement is to decide the semantic directions of words, sentences or records. Notion investigation is about conclusion mining. Break down feelings, attributes and assessments of clients about any items, subjects, or issue. For the popular feeling, web is turning into a spreading and exceptionally wide stage where online gatherings, social locales, websites and different destinations contains sentiment and audit of individuals in type of remarks and posted messages. Presently a days the information acquired from these destinations, online journals and remarks and publication is helpful for advertising research. Right now propose an extraction method to score the audits and condense the suppositions to end client. In light of conclusions mined it is chosen as whether to break down the slant of client feed backs and furthermore channel the sentiments dependent on client areas. This venture for the most part centers on giving a system to mining the feelings utilizing nonexclusive client centered surveys utilizing common language preparing steps. We can actualize this system progressively situations and furthermore improve the precision in feeling mining in python structure.
尽可能多地利用网络讨论作为交换数据和评估的舞台,就像宣传传播一样。客户端在网络上制作的内容现在发展很快。创新的变革利用这些数据来捕捉客户的实质,最后有价值的数据被呈现给数据搜索者。目前大多数关于内容数据准备的研究都集中在真实区域,而不是评估空间。内容挖掘是网络采集情感挖掘的基础性工作。尽管如此,从在线讨论中挖掘感觉比纯粹的内容过程要麻烦得多,因为它们具有半组织性。依赖于意见的秩序已经成为内容挖掘网络的另一个外围。假设排列的指派是决定词、句子或记录的语义方向。概念调查就是结论挖掘。分解客户对任何项目、主题或问题的感受、属性和评估。对于大众情感来说,网络正在变成一个传播和异常广泛的舞台,在线聚会,社交场所,网站和不同的目的地以评论和发布的消息的形式包含个人的情绪和审计。目前,从这些网站、在线期刊、评论和出版物中获得的信息对广告研究很有帮助。现在提出一种提取方法来对审计进行评分,并将假设浓缩给最终客户。根据挖掘的结论,选择是否打破客户反馈的倾斜,并进一步引导依赖于客户区域的情绪。这一冒险在很大程度上集中于提供一个系统,利用非排他性的以客户为中心的调查,利用共同的语言准备步骤来挖掘情感。该系统可以逐步实现,进一步提高python结构中情感挖掘的精度。
{"title":"Sentimental Analysis (Opinion Mining) in Social Network by Using Svm Algorithm","authors":"T. Sathis Kumar, P. Mohamed Nabeem, C. K. Manoj, K. Jeyachandran","doi":"10.1109/ICCMC48092.2020.ICCMC-000159","DOIUrl":"https://doi.org/10.1109/ICCMC48092.2020.ICCMC-000159","url":null,"abstract":"Web discussions are as often as possible utilized as stages for the trading of data and assessments just as publicity dispersal. The client produced content on the web develops quickly right now age. The transformative changes in innovation utilize such data to catch just the client’s substance lastly the valuable data are presented to data searchers. The majority of the current research on content data preparing, centers in the genuine area as opposed to the assessment space. Content mining assumes a fundamental job in online gathering feeling mining. Be that as it may, feeling mining from online discussion is significantly more troublesome than unadulterated content procedure because of their semi organized qualities. Order dependent on opinions has become another outskirts to content mining network. The assignment of assumption arrangement is to decide the semantic directions of words, sentences or records. Notion investigation is about conclusion mining. Break down feelings, attributes and assessments of clients about any items, subjects, or issue. For the popular feeling, web is turning into a spreading and exceptionally wide stage where online gatherings, social locales, websites and different destinations contains sentiment and audit of individuals in type of remarks and posted messages. Presently a days the information acquired from these destinations, online journals and remarks and publication is helpful for advertising research. Right now propose an extraction method to score the audits and condense the suppositions to end client. In light of conclusions mined it is chosen as whether to break down the slant of client feed backs and furthermore channel the sentiments dependent on client areas. This venture for the most part centers on giving a system to mining the feelings utilizing nonexclusive client centered surveys utilizing common language preparing steps. We can actualize this system progressively situations and furthermore improve the precision in feeling mining in python structure.","PeriodicalId":130581,"journal":{"name":"2020 Fourth International Conference on Computing Methodologies and Communication (ICCMC)","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117291786","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}
引用次数: 9
期刊
2020 Fourth International Conference on Computing Methodologies and Communication (ICCMC)
全部 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学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1