Int. J. Rough Sets Data Anal.最新文献

筛选
英文 中文
Algebraic Properties of Rough Set on Two Universal Sets based on Multigranulation 基于多粒的两全称集上粗糙集的代数性质
Int. J. Rough Sets Data Anal. Pub Date : 2014-07-01 DOI: 10.4018/ijrsda.2014070104
M. Geetha, D. Acharjya, N. Iyengar
{"title":"Algebraic Properties of Rough Set on Two Universal Sets based on Multigranulation","authors":"M. Geetha, D. Acharjya, N. Iyengar","doi":"10.4018/ijrsda.2014070104","DOIUrl":"https://doi.org/10.4018/ijrsda.2014070104","url":null,"abstract":"The rough set philosophy is based on the concept that there is some information associated with each object of the universe. The set of all objects of the universe under consideration for particular discussion is considered as a universal set. So, there is a need to classify objects of the universe based on the indiscernibility relation (equivalence relation) among them. In the view of granular computing, rough set model is researched by single granulation. The granulation in general is carried out based on the equivalence relation defined over a universal set. It has been extended to multi-granular rough set model in which the set approximations are defined by using multiple equivalence relations on the universe simultaneously. But, in many real life scenarios, an information system establishes the relation with different universes. This gave the extension of multi-granulation rough set on single universal set to multi-granulation rough set on two universal sets. In this paper, we define multi-granulation rough set for two universal sets U and V. We study the algebraic properties that are interesting in the theory of multi-granular rough sets. This helps in describing and solving real life problems more accurately.","PeriodicalId":152357,"journal":{"name":"Int. J. Rough Sets Data Anal.","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127546273","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}
引用次数: 36
Identification of Heart Valve Disease using Bijective Soft Sets Theory 用双目标软集理论识别心脏瓣膜疾病
Int. J. Rough Sets Data Anal. Pub Date : 2014-07-01 DOI: 10.4018/IJRSDA.2014070101
S. U. Kumar, H. Inbarani, A. Azar, A. Hassanien
{"title":"Identification of Heart Valve Disease using Bijective Soft Sets Theory","authors":"S. U. Kumar, H. Inbarani, A. Azar, A. Hassanien","doi":"10.4018/IJRSDA.2014070101","DOIUrl":"https://doi.org/10.4018/IJRSDA.2014070101","url":null,"abstract":"Major complication of heart valve diseases is congestive heart valve failure. The heart is of essential significance to human beings. Auscultation with a stethoscope is considered as one of the techniques used in the analysis of heart diseases. Heart auscultation is a difficult task to determine the heart condition and requires some superior training of medical doctors. Therefore, the use of computerized techniques in the diagnosis of heart sounds may help the doctors in a clinical environment. Hence, in this study computer-aided heart sound diagnosis is performed to give support to doctors in decision making. In this study, a novel hybrid Rough-Bijective soft set is developed for the classification of heart valve diseases. A rough set (Quick Reduct) based feature selection technique is applied before classification for increasing the classification accuracy. The experimental results demonstrate that the overall classification accuracy offered by the employed Improved Bijective soft set approach (IBISOCLASS) provides higher accuracy compared with other classification techniques including hybrid Rough-Bijective soft set (RBISOCLASS), Bijective soft set (BISOCLASS), Decision table (DT), Naive Bayes (NB) and J48.","PeriodicalId":152357,"journal":{"name":"Int. J. Rough Sets Data Anal.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114937694","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}
引用次数: 23
A Hybrid Approach to Diagnosis of Hepatic Tumors in Computed Tomography Images 计算机断层扫描图像中肝脏肿瘤的混合诊断方法
Int. J. Rough Sets Data Anal. Pub Date : 2014-07-01 DOI: 10.4018/ijrsda.2014070103
A. Anter, M. Elsoud, A. Azar, A. Hassanien
{"title":"A Hybrid Approach to Diagnosis of Hepatic Tumors in Computed Tomography Images","authors":"A. Anter, M. Elsoud, A. Azar, A. Hassanien","doi":"10.4018/ijrsda.2014070103","DOIUrl":"https://doi.org/10.4018/ijrsda.2014070103","url":null,"abstract":"Liver cancer is one of the most popular cancer diseases and causes a large amount of death every year, can be reduced by early detection and diagnosis. Computer-aided liver analysis can help in the early detection and diagnosis of liver cancer. In this paper, enhancement and segmentation process is applied to increase the computation and focus on liver parenchyma. This parenchyma also segmented using Watershed and Region Growing algorithms to extract liver tumors. These tumors will be analyzed and characterized to distinguish between hemangioma (benign) and hepatocellular (malignant) tumors using Local Binary Pattern (LBP), Gray Level Co-occurrence matrix (GLCM), Fractal Dimension (FD) and feature fusion technique is applied to maximize and enhance the performance of the classifier rate. The authors review different methods for liver segmentation and abnormality classification. An attempt was made to combine the individual scores from different techniques in order to compensate their individual weaknesses and to preserve their strength. The authors present and exhaustively evaluate algorithms using computer vision techniques. The experimental results based on confusion matrix and kappa coefficient show that the higher accuracy is obtained of automatic agreement classification and suggest that the developed CAD system has great potential and promise in the automatic diagnosis of both benign and malignant tumors of liver.","PeriodicalId":152357,"journal":{"name":"Int. J. Rough Sets Data Anal.","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123857102","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}
引用次数: 39
Image Segmentation Using Rough Set Theory: A Review 基于粗糙集理论的图像分割研究进展
Int. J. Rough Sets Data Anal. Pub Date : 2014-07-01 DOI: 10.4018/ijrsda.2014070105
Payel Roy, S. Goswami, Sayan Chakraborty, A. Azar, N. Dey
{"title":"Image Segmentation Using Rough Set Theory: A Review","authors":"Payel Roy, S. Goswami, Sayan Chakraborty, A. Azar, N. Dey","doi":"10.4018/ijrsda.2014070105","DOIUrl":"https://doi.org/10.4018/ijrsda.2014070105","url":null,"abstract":"In the domain of image processing, image segmentation has become one of the key application that is involved in most of the image based operations. Image segmentation refers to the process of breaking or partitioning any image. Although, like several image processing operations, image segmentation also faces some problems and issues when segmenting process becomes much more complicated. Previously lot of work has proved that Rough-set theory can be a useful method to overcome such complications during image segmentation. The Rough-set theory helps in very fast convergence and in avoiding local minima problem, thereby enhancing the performance of the EM, better result can be achieved. During rough-set-theoretic rule generation, each band is individualized by using the fuzzy-correlation-based gray-level thresholding. Therefore, use of Rough-set in image segmentation can be very useful. In this paper, a summary of all previous Rough-set based image segmentation methods are described in detail and also categorized accordingly. Rough-set based image segmentation provides a stable and better framework for image segmentation.","PeriodicalId":152357,"journal":{"name":"Int. J. Rough Sets Data Anal.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129044117","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}
引用次数: 88
A New Heuristic Function of Ant Colony System for Retinal Vessel Segmentation 一种新的启发式函数的蚁群系统视网膜血管分割
Int. J. Rough Sets Data Anal. Pub Date : 2014-07-01 DOI: 10.4018/ijrsda.2014070102
Ahmed H. Asad, A. Azar, A. Hassanien
{"title":"A New Heuristic Function of Ant Colony System for Retinal Vessel Segmentation","authors":"Ahmed H. Asad, A. Azar, A. Hassanien","doi":"10.4018/ijrsda.2014070102","DOIUrl":"https://doi.org/10.4018/ijrsda.2014070102","url":null,"abstract":"The automatic segmentation of blood vessels in retinal images is the crucial stage in any retina diagnosis systems. This article discussed the impact of two improvements to the previous baseline approach for automatic segmentation of retinal blood vessels based on the ant colony system. The first improvement is in features where the length of previous features vector used in segmentation is reduced to the half since four less significant features are replaced by a new more significant feature when applying the correlation-based feature selection heuristic. The second improvement is in ant colony system where a new probability-based heuristic function is applied instead of the previous Euclidean distance based heuristic function. Experimental results showed the improved approach gives better performance than baseline approach when it is tested on DRIVE database of retinal images. Also, the statistical analysis demonstrated that was no statistically significant difference between the baseline and improved approaches in the sensitivity (0.7388a± 0.0511 vs. 0.7501a±0.0385, respectively; P = 0.4335). On the other hand, statistically significant improvements were found between the baseline and improved approaches for specificity and accuracy (P = 0.0024 and 0.0053, respectively). It was noted that the improved approach showed an increase of 1.1% in the accuracy after applying the new probability-based heuristic function.","PeriodicalId":152357,"journal":{"name":"Int. J. Rough Sets Data Anal.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130274035","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}
引用次数: 49
I-Rough Topological Spaces i -粗糙拓扑空间
Int. J. Rough Sets Data Anal. Pub Date : 2012-10-26 DOI: 10.4018/IJRSDA.2016010106
Boby P. Mathew, S. J. John
{"title":"I-Rough Topological Spaces","authors":"Boby P. Mathew, S. J. John","doi":"10.4018/IJRSDA.2016010106","DOIUrl":"https://doi.org/10.4018/IJRSDA.2016010106","url":null,"abstract":"R ough set theory is a mathematical tool to deal with incomplete and imprecise data and topology is the study of invariance of a space under topological transformations known as homeomorphisms.  In this paper an attempt is made to develop general topological structure on rough sets. We defined rough topology on a rough set and some basic topological properties of the resultant Rough Topological Spaces (RTS), such as rough open sets, rough closed sets, rough base and rough closure, etc. are studied.","PeriodicalId":152357,"journal":{"name":"Int. J. Rough Sets Data Anal.","volume":"196 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132683608","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}
引用次数: 10
An Approach to Clustering of Text Documents Using Graph Mining Techniques 一种基于图挖掘技术的文本文档聚类方法
Int. J. Rough Sets Data Anal. Pub Date : 1900-01-01 DOI: 10.4018/IJRSDA.2017010103
B. Rao, B. K. Mishra
{"title":"An Approach to Clustering of Text Documents Using Graph Mining Techniques","authors":"B. Rao, B. K. Mishra","doi":"10.4018/IJRSDA.2017010103","DOIUrl":"https://doi.org/10.4018/IJRSDA.2017010103","url":null,"abstract":"This paper introduces a new approach of clustering of text documents based on a set of words using graph mining techniques. The proposed approach clusters (groups) those text documents having searched successfully for the given set of words from a set of given text documents. The document-word relation can be represented as a bi-partite graph. All the clustering of text documents is represented as sub-graphs. Further, the paper proposes an algorithm for clustering of text documents for a given set of words. It is an automated system and requires minimal human interaction for the clustering of text documents. The algorithm has been implemented using C++ programming language and observed satisfactory results. KeywoRDS Bi-partite Graph Clustering, Self-loop, Sub-graph, Weighted Un-Oriented Incidence Matrix","PeriodicalId":152357,"journal":{"name":"Int. J. Rough Sets Data Anal.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129755414","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}
引用次数: 32
A Rough Set Theory Approach for Rule Generation and Validation Using RSES 基于RSES的规则生成和验证的粗糙集理论方法
Int. J. Rough Sets Data Anal. Pub Date : 1900-01-01 DOI: 10.4018/IJRSDA.2016010104
H. Rana, Manohar Lal
{"title":"A Rough Set Theory Approach for Rule Generation and Validation Using RSES","authors":"H. Rana, Manohar Lal","doi":"10.4018/IJRSDA.2016010104","DOIUrl":"https://doi.org/10.4018/IJRSDA.2016010104","url":null,"abstract":"Despite significant progress in e-learning technology over previous years, in view of huge sizes of data and databases, efficient knowledge extraction techniques are still required to make e-learning effective tool for delivery of learning. Rough set theory approach provides an effective technique for extraction of knowledge out of massive data. In order to provide effective support to learners, it is essential to know individual style of learning for each learner. For determining learning style of each learner, one is required to extract essentials of style of learning from a large number of parameters including academic background, profession, time available etc. In such scenario, rough theory proves a useful tool. In this paper, a rough set theory approach is proposed for determining learning styles of learners efficiently, so that based on the style, a learner may be provided learning support on the basis of requirement of the learner. These is achieved by eliminating redundant and ambiguous data and by generating reduct set, core set and rules from the given data. The results of this study are validated through RSES software by using same rough set analysis.","PeriodicalId":152357,"journal":{"name":"Int. J. Rough Sets Data Anal.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115625587","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
Hybrid TRS-PSO Clustering Approach for Web2.0 Social Tagging System Web2.0社会标签系统的混合TRS-PSO聚类方法
Int. J. Rough Sets Data Anal. Pub Date : 1900-01-01 DOI: 10.4018/ijrsda.2015010102
H. Inbarani H., Selva Kumar S, Ahmad Taher Azar, A. Hassanien
{"title":"Hybrid TRS-PSO Clustering Approach for Web2.0 Social Tagging System","authors":"H. Inbarani H., Selva Kumar S, Ahmad Taher Azar, A. Hassanien","doi":"10.4018/ijrsda.2015010102","DOIUrl":"https://doi.org/10.4018/ijrsda.2015010102","url":null,"abstract":"Social tagging is one of the vital attributes of WEB2.0. The challenge of Web 2.0 is a gigantic measure of information created over a brief time. Tags are broadly used to interpret and arrange the web 2.0 assets. Tag clustering is the procedure of grouping the comparable tags into clusters. The tag clustering is extremely valuable for researching and organizing the web2. 0 resources furthermore critical for the achievement of Social Bookmarking frameworks. In this paper, the authors proposed a hybrid Tolerance Rough Set Based Firefly TRS-Firefly-K-Means clustering algorithm for clustering tags in social systems. At that stage, the proposed system is contrasted with the benchmark algorithm K-Means clustering and Particle Swarm optimization PSO based Clustering technique. The experimental analysis outlines the viability of the suggested methodology.","PeriodicalId":152357,"journal":{"name":"Int. J. Rough Sets Data Anal.","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128553992","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}
引用次数: 41
Rough Set Based Similarity Measures for Data Analytics in Spatial Epidemiology 基于粗糙集的空间流行病学数据分析相似性度量
Int. J. Rough Sets Data Anal. Pub Date : 1900-01-01 DOI: 10.4018/IJRSDA.2016010107
Sharmila Banu Kather, B. Tripathy
{"title":"Rough Set Based Similarity Measures for Data Analytics in Spatial Epidemiology","authors":"Sharmila Banu Kather, B. Tripathy","doi":"10.4018/IJRSDA.2016010107","DOIUrl":"https://doi.org/10.4018/IJRSDA.2016010107","url":null,"abstract":"Epidemiological studies are carried out to understand the pattern and transmission of disease instances. Some prominent dimensions considered for analysis are cohort studies, ecological studies, transmission modeling and prediction. 'Descriptive Epidemiology' is defined with respect to 'people, time and place'. Place geography plays a key role in the pattern of disease outcomes in both epidemic outbreaks and chronic cases. A lot of research has documented the significance of spatial features in Epidemiology and have produced health/disease maps of a particular geography. This work proposes to identify similarity between regions in such maps using Rough set based measures. Thus spatial auto-correlation of disease instances in a geographic region can be analysed further to prepare mitigation strategies.","PeriodicalId":152357,"journal":{"name":"Int. J. Rough Sets Data Anal.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130476856","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}
引用次数: 38
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信