发布求助
文献互助 智能选刊 最新文献

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

筛选
英文 中文
Improved Fuzzy Rank Aggregation 改进的模糊等级聚合
Int. J. Rough Sets Data Anal. Pub Date : 2018-10-01 DOI: 10.4018/IJRSDA.2018100105
M. Z. Ansari, M. Beg
{"title":"Improved Fuzzy Rank Aggregation","authors":"M. Z. Ansari, M. Beg","doi":"10.4018/IJRSDA.2018100105","DOIUrl":"https://doi.org/10.4018/IJRSDA.2018100105","url":null,"abstract":"Rank aggregation is applied on the web to build various applications like meta-search engines, consumer reviews classification, and recommender systems. Meta-searching is the generation of a single list from a collection of the results produced by multiple search engines, together using a rank aggregation technique. It is an efficient and cost-effective technique to retrieve quality results from the internet. The quality of results produced by a meta-searching relies upon the efficiency of rank aggregation technique applied. An effective rank aggregation technique assigns the rank to a document that is closest to all its previous rankings. The newly generated list of documents may be evaluated by the measurement of Spearman footrule distance. In this article, various fuzzy logic techniques for rank aggregation are analyzed and further improvements are proposed in Modified Shimura technique. Consequently, two novel OWA operators are suggested for the calculation of membership values of document ranks in a modified Shimura technique. The performance of proposed improvements is evaluated on the Spearman footrule distance along with execution time. The results show that the anticipated improvements exhibit better performance than other fuzzy techniques.","PeriodicalId":152357,"journal":{"name":"Int. J. Rough Sets Data Anal.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123131218","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
Cryptanalysis and Improvement of a Digital Watermarking Scheme Using Chaotic Map 基于混沌映射的数字水印方案的密码分析与改进
Int. J. Rough Sets Data Anal. Pub Date : 2018-10-01 DOI: 10.4018/IJRSDA.2018100104
Musheer Ahmad, H. Al-Sharari
{"title":"Cryptanalysis and Improvement of a Digital Watermarking Scheme Using Chaotic Map","authors":"Musheer Ahmad, H. Al-Sharari","doi":"10.4018/IJRSDA.2018100104","DOIUrl":"https://doi.org/10.4018/IJRSDA.2018100104","url":null,"abstract":"In the recent past, a new statistically efficient digital image watermarking scheme based on chaotic map was proposed. The authors of this watermarking scheme claimed under study that their scheme is efficient, secure, and highly robust against various attacks. However, the security analysis of the scheme unveils that it has serious inherent flaws. In this article, the shortcomings of the proposed watermarking scheme and cryptanalysis are presented to demonstrate that the scheme is not secure against the proposed attacks. Specifically, with the chosen host image and chosen watermarks, we can successfully recover the watermark from received watermarked image without having any knowledge of the secret key. The simulation analysis of the proposed cryptanalysis is provided to exemplify the proposed attack and lack of security of the anticipated watermarking scheme. In addition, an improved version is proposed to enhance the security performance of the watermarking scheme against possible attacks. The improved scheme tends to hold against attacks and statistical efficiency.","PeriodicalId":152357,"journal":{"name":"Int. J. Rough Sets Data Anal.","volume":"265 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116175016","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}
引用次数: 21
Secure Mechanisms for Key Shares in Cloud Computing 云计算中密钥共享的安全机制
Int. J. Rough Sets Data Anal. Pub Date : 2018-07-01 DOI: 10.4018/IJRSDA.2018070102
A. Buchade, Rajesh Ingle
{"title":"Secure Mechanisms for Key Shares in Cloud Computing","authors":"A. Buchade, Rajesh Ingle","doi":"10.4018/IJRSDA.2018070102","DOIUrl":"https://doi.org/10.4018/IJRSDA.2018070102","url":null,"abstract":"The protection of the key is important due to the vulnerabilities which exist in cloud computing. In this article, algorithms and techniques for protection of the key in cloud computing are proposed. The algorithms to select the number of virtual machines is presented to protect the key. The existing key management algorithm is modified to address the key leakage issue. The novel techniques such as validation of key shares and key share resharing are introduced and analyzed for protection of the key. These techniques make the attackers incompetence to reconstruct the key. Further, for immediate access of protected resources, key reconstruction for key sizes of a cryptographic algorithm is also analyzed.","PeriodicalId":152357,"journal":{"name":"Int. J. Rough Sets Data Anal.","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121367881","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}
引用次数: 14
Reversible Data Hiding Scheme for ECG Signal 心电信号的可逆数据隐藏方案
Int. J. Rough Sets Data Anal. Pub Date : 2018-07-01 DOI: 10.4018/IJRSDA.2018070103
Naghma Tabassum, M. Izharuddin
{"title":"Reversible Data Hiding Scheme for ECG Signal","authors":"Naghma Tabassum, M. Izharuddin","doi":"10.4018/IJRSDA.2018070103","DOIUrl":"https://doi.org/10.4018/IJRSDA.2018070103","url":null,"abstract":"In telemedicine system, remote electrocardiography (ECG) monitoring systems are widely used to examine the cardiac health of a patient. So, huge amount of ECG data is collected in real time and send over the network along with the patient's identity to his/her doctor who is geographically far away. In that scenario, it is very important to protect patient's confidential information. The Health Insurance Portability and Accountability Act (HIPAA) of 1996 in US mandates that confidential and private information related to patients be protected. To serve this purpose a novel reversible watermarking algorithm with high embedding capacity based on wavelet transform has been developed. The proposed reversible data hiding scheme allows ECG signals to hide its corresponding patient's confidential data and being reversible the original signal can be completely restored at the same time. Performance has been evaluated in terms of ECG signal distortion and embedding capacity. Experimental results show that the original ECG signal is recovered exactly after the extraction of watermarked data.","PeriodicalId":152357,"journal":{"name":"Int. J. Rough Sets Data Anal.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129649217","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
8-Bit Quantizer for Chaotic Generator With Reduced Hardware Complexity 降低硬件复杂度的混沌发生器8位量化器
Int. J. Rough Sets Data Anal. Pub Date : 2018-07-01 DOI: 10.4018/IJRSDA.2018070104
Zamarrud, M. Izharuddin
{"title":"8-Bit Quantizer for Chaotic Generator With Reduced Hardware Complexity","authors":"Zamarrud, M. Izharuddin","doi":"10.4018/IJRSDA.2018070104","DOIUrl":"https://doi.org/10.4018/IJRSDA.2018070104","url":null,"abstract":"This article describes how nowadays, data is widely transmitted over the internet in the real time. Wherever the transmission or storage is required, security is needed. High speed processing hardware machine with reduced complexity are used for the security of the data, that are transmitted in real time. The information which is to be secure are encoded by pseudorandom key. Chaotic numbers are used in place of a pseudorandom key. The generated chaotic values are analogous in nature, these analog values are digitized to generate encryption key like 8-bit, 16-bit, 32-bit. To generate an 8-bit key, an 8-bit quantizer is required. The design of 8-bit quantizer requires 256 levels which needs lot of complex hardware to implement. In this article, an 8-bit quantizer is designed with reduced complexity, where hardware requirement is reduced by more than 12 times. Without compromising the randomness of the sequence generated. To increase the randomness and confusion timed hop random selection is used. The randomness of the sequence generated by the chaotic generators is analyzed by NIST test suite, to test for its randomness.","PeriodicalId":152357,"journal":{"name":"Int. J. Rough Sets Data Anal.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121307150","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
Detection of Automobile Insurance Fraud Using Feature Selection and Data Mining Techniques 基于特征选择和数据挖掘技术的汽车保险欺诈检测
Int. J. Rough Sets Data Anal. Pub Date : 2018-07-01 DOI: 10.4018/IJRSDA.2018070101
Sharmila Subudhi, S. Panigrahi
{"title":"Detection of Automobile Insurance Fraud Using Feature Selection and Data Mining Techniques","authors":"Sharmila Subudhi, S. Panigrahi","doi":"10.4018/IJRSDA.2018070101","DOIUrl":"https://doi.org/10.4018/IJRSDA.2018070101","url":null,"abstract":"This article presents a novel approach for fraud detection in automobile insurance claims by applying various data mining techniques. Initially, the most relevant attributes are chosen from the original dataset by using an evolutionary algorithm based feature selection method. A test set is then extracted from the selected attribute set and the remaining dataset is subjected to the Possibilistic Fuzzy C-Means (PFCM) clustering technique for the undersampling approach. The 10-fold cross validation method is then used on the balanced dataset for training and validating a group of Weighted Extreme Learning Machine (WELM) classifiers generated from various combinations of WELM parameters. Finally, the test set is applied on the best performing model for classification purpose. The efficacy of the proposed system is illustrated by conducting several experiments on a real-world automobile insurance defraud dataset. Besides, a comparative analysis with another approach justifies the superiority of the proposed system.","PeriodicalId":152357,"journal":{"name":"Int. J. Rough Sets Data Anal.","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121177795","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}
引用次数: 28
A Roughset Based Ensemble Framework for Network Intrusion Detection System 基于粗糙集的网络入侵检测系统集成框架
Int. J. Rough Sets Data Anal. Pub Date : 2018-07-01 DOI: 10.4018/IJRSDA.2018070105
S. Rodda, Uma Shankar Erothi
{"title":"A Roughset Based Ensemble Framework for Network Intrusion Detection System","authors":"S. Rodda, Uma Shankar Erothi","doi":"10.4018/IJRSDA.2018070105","DOIUrl":"https://doi.org/10.4018/IJRSDA.2018070105","url":null,"abstract":"Designing an effective network intrusion detection system is becoming an increasingly difficult task as the sophistication of the attacks have been increasing every day. Usage of machine learning approaches has been proving beneficial in such situations. Models may be developed based on patterns differentiating attack traffic from network traffic to gain insight into the network activity to identify and report attacks. In this article, an ensemble framework based on roughsets is used to efficiently identify attacks in a multi-class scenario. The proposed methodology is validated on benchmark KDD Cup '99 and NSL_KDD network intrusion detection datasets as well as six other standard UCI datasets. The experimental results show that proposed technique RST achieved better detection rate with low false alarm rate compared to bagging and RSM.","PeriodicalId":152357,"journal":{"name":"Int. J. Rough Sets Data Anal.","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117172794","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}
引用次数: 24
A Novel Aspect Based Framework for Tourism Sector with Improvised Aspect and Opinion Mining Algorithm 基于临时方面和意见挖掘算法的旅游部门面向方面的新框架
Int. J. Rough Sets Data Anal. Pub Date : 2018-04-01 DOI: 10.4018/IJRSDA.2018040106
Vishal Bhatnagar, Mahima Goyal, Mohammad Anayat Hussain
{"title":"A Novel Aspect Based Framework for Tourism Sector with Improvised Aspect and Opinion Mining Algorithm","authors":"Vishal Bhatnagar, Mahima Goyal, Mohammad Anayat Hussain","doi":"10.4018/IJRSDA.2018040106","DOIUrl":"https://doi.org/10.4018/IJRSDA.2018040106","url":null,"abstract":"Withthegrowthofe-commercewebsites,thedemandofwritingreviewsontheseportalshavegained hugepopularity.Thishugedatamustbeminedtoanalyzetheopinionandformakingbetterdecisions indifferentdomains.Inthispaper,wehaveproposedanaspectbasedopinionminingalgorithmfor thetourismdomain.Itfirstdeterminestheaspects,andthenextractstheopinionwordsrelatedtothe aspects.TheopinionwordsareprovidedascorebasedontheSenti-Wordnetandthefinalscoreof eachaspectiscalculatedbythesummationofthescoresoftheopinions.Thefinalscoreisvisualized depictingrankingofscoresofdifferentaspectsfordifferenthotels. KeywORDS Aspect Based, Opinion Mining, Senti-Wordnet, Tourism Domain","PeriodicalId":152357,"journal":{"name":"Int. J. Rough Sets Data Anal.","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125033446","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
Random Search Based Efficient Chaotic Substitution Box Design for Image Encryption 基于随机搜索的图像加密高效混沌替换盒设计
Int. J. Rough Sets Data Anal. Pub Date : 2018-04-01 DOI: 10.4018/IJRSDA.2018040107
Musheer Ahmad, Zishan Ahmad
{"title":"Random Search Based Efficient Chaotic Substitution Box Design for Image Encryption","authors":"Musheer Ahmad, Zishan Ahmad","doi":"10.4018/IJRSDA.2018040107","DOIUrl":"https://doi.org/10.4018/IJRSDA.2018040107","url":null,"abstract":"CryptographicSubstitution-boxesaresourceofnonlinearityinmodernblockencryptionsystems. Therobustnessandconfusionimpartedthroughthesesystemsheavilyrelyonthestrengthoftheir S-boxes.ThisbringsnewchallengestodesigncryptographicallypotentS-boxestodevelopstrong encryptionsystems.Inthispaper,aneffectivemethodtodesignefficient8×8S-boxisproposed. The design methodology incorporates piece-wise linear chaotic map based random search. The S-boxobtainedbytheproposedmethodologyistestedagainststandardstatisticaltestslikebijective property, strict avalanche criteria, nonlinearity, differential uniformity, bits independent criteria, andlinearapproximationprobability,revealingitsoutstandingperformance.TheproposedS-boxis comparedwithsomerecentchaos-based8×8S-boxes.Moreover,theproposedS-boxisappliedto encryptplain-imagewithproposedS-boxtransformationtounveilandhighlightitsinherentgreat encryptionstrength.Theresultsconfirmthatthedesignisconsistentandsuitableforbuildingstrong encryptionsystemsforsecurecommunication. KEywoRDS Chaotic System, Image Encryption, Random Search, Secure Communication, Security, Substitution-Box","PeriodicalId":152357,"journal":{"name":"Int. J. Rough Sets Data Anal.","volume":"35 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114131787","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}
引用次数: 34
An Efficient Random Valued Impulse Noise Suppression Technique Using Artificial Neural Network and Non-Local Mean Filter 基于人工神经网络和非局部均值滤波的随机值脉冲噪声抑制技术
Int. J. Rough Sets Data Anal. Pub Date : 2018-04-01 DOI: 10.4018/IJRSDA.2018040108
Bibekananda Jena, Punyaban Patel, G. Sinha
{"title":"An Efficient Random Valued Impulse Noise Suppression Technique Using Artificial Neural Network and Non-Local Mean Filter","authors":"Bibekananda Jena, Punyaban Patel, G. Sinha","doi":"10.4018/IJRSDA.2018040108","DOIUrl":"https://doi.org/10.4018/IJRSDA.2018040108","url":null,"abstract":"AnewtechniqueforsuppressionofRandomvaluedimpulsenoisefromthecontaminateddigital imageusingBackPropagationNeuralNetworkisproposedinthispaper.Thealgorithmsconsistof twostagesi.e.DetectionofImpulsenoiseandFilteringofidentifiednoisypixels.Toclassifybetween noisyandnon-noisyelementpresentintheimageafeed-forwardneuralnetworkhasbeentrained withwell-knownbackpropagationalgorithminthefirststage.Tomakethedetectionmethodmore accurate,Emphasishasbeengivenonselectionofproperinputandgenerationoftrainingpatterns. Thecorruptedpixelsareundergoingnon-localmeanfilteringemployedinthesecondstage.The effectivenessoftheproposedtechniqueisevaluatedusingwellknownstandarddigitalimagesat different levelof impulsenoise.Experiments show that themethodproposedherehasexcellent impulsenoisesuppressioncapability. KEywoRDS Artificial Neural Network (ANN), Image Denoising, Peak Signal-to-Noise Ratio (PSNR), Random Valued Impulse Noise (RVIN)","PeriodicalId":152357,"journal":{"name":"Int. J. Rough Sets Data Anal.","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122509524","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}
引用次数: 29
首页 上一页 下一页 尾页
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学术官方微信