{"title":"FLANN + BHO: A Novel Approach for Handling Nonlinearity in System Identification","authors":"B. Naik, Janmenjoy Nayak, H. Behera","doi":"10.4018/IJRSDA.2018010102","DOIUrl":"https://doi.org/10.4018/IJRSDA.2018010102","url":null,"abstract":"","PeriodicalId":152357,"journal":{"name":"Int. J. Rough Sets Data Anal.","volume":"43 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":"134483534","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Two Rough Set-based Software Tools for Analyzing Non-Deterministic Data","authors":"Mao Wu, M. Nakata, H. Sakai","doi":"10.4018/ijrsda.2014010103","DOIUrl":"https://doi.org/10.4018/ijrsda.2014010103","url":null,"abstract":"Rough Non-deterministic Information Analysis (RNIA) is a rough set-based framework for handling tables with exact and inexact data. Under this framework, the authors have coped with several issues, for example, possible equivalence relations, data dependencies, rule generation, rule stability, question-answering as well as missing and interval values as special cases of non-deterministic values. In this paper, the authors at first survey a software tool in Prolog and C for dealing issues like rule generation and question-answering, then we report the current state of our new web tool called getRNIA. The authors also propose a new issue focusing on the estimation of actual derived DIS from a Non-deterministic Information System, by employing constraints like Equivalence Classes, Data Dependency, Maximum Likelihood Estimation and Data Consistency.","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":"130918879","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}
A-K. A. Radhwan, Mahmoud Kamel, M. Dahab, A. Hassanien
{"title":"Forecasting Exchange Rates: A Chaos-Based Regression Approach","authors":"A-K. A. Radhwan, Mahmoud Kamel, M. Dahab, A. Hassanien","doi":"10.4018/ijrsda.2015010103","DOIUrl":"https://doi.org/10.4018/ijrsda.2015010103","url":null,"abstract":"Accurate forecasting for future events constitutes a fascinating challenge for theoretical and for applied researches. Foreign Exchange market FOREX is selected in this research to represent an example of financial systems with a complex behavior. Forecasting a financial time series can be a very hard task due to the inherent uncertainty nature of these systems. It seems very difficult to tell whether a series is stochastic or deterministic chaotic or some combination of these states. More generally, the extent to which a non-linear deterministic process retains its properties when corrupted by noise is also unclear. The noise can affect a system in different ways even though the equations of the system remain deterministic. Since a single reliable statistical test for chaoticity is not available, combining multiple tests is a crucial aspect, especially when one is dealing with limited and noisy data sets like in economic and financial time series. In this research, the authors propose an improved model for forecasting exchange rates based on chaos theory that involves phase space reconstruction from the observed time series and the use of support vector regression SVR for forecasting.Given the exchange rates of a currency pair as scalar observations, observed time series is first analyzed to verify the existence of underlying nonlinear dynamics governing its evolution over time. Then, the time series is embedded into a higher dimensional phase space using embedding parameters.In the selection process to find the optimal embedding parameters,a novel method based on the Differential Evolution DE geneticalgorithmas a global optimization technique was applied. The authors have compared forecasting accuracy of the proposed model against the ordinary use of support vector regression. The experimental results demonstrate that the proposed method, which is based on chaos theory and genetic algorithm,is comparable with the existing approaches.","PeriodicalId":152357,"journal":{"name":"Int. J. Rough Sets Data Anal.","volume":"17 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":"121223311","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Hybrid TRS-FA Clustering Approach for Web2.0 Social Tagging System","authors":"H. Inbarani, S. S. Kumar","doi":"10.4018/ijrsda.2015010105","DOIUrl":"https://doi.org/10.4018/ijrsda.2015010105","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. Hybrid TRS-FA Clustering Approach for Web2.0 Social Tagging System","PeriodicalId":152357,"journal":{"name":"Int. J. Rough Sets Data Anal.","volume":"8 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":"132727076","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Fuzzy Knowledge Based Fault Tolerance Mechanism for Wireless Sensor Networks","authors":"S. Acharya, C. Tripathy","doi":"10.4018/IJRSDA.2018010107","DOIUrl":"https://doi.org/10.4018/IJRSDA.2018010107","url":null,"abstract":"Wireless Sensor Networks (WSNs) are the focus of considerable research for different applications. This paper proposes a Fuzzy Knowledge based Artificial Neural Network Routing (ANNR) fault tolerance mechanism for WSNs. The proposed method uses an exponential Bi-directional Associative Memory (eBAM) for the encoding and decoding of data packets and application of Intelligent Sleeping Mechanism (ISM) to conserve energy. A combination of fuzzy rules is used to identify the faulty nodes in the network. The Cluster Head (CH) acts as the data aggregator in the network. It applies the fuzzy knowledge based Node Appraisal Technique (NAT) in order to identify the faulty nodes in the network. The performance of the proposed ANNR is compared with that of Low-Energy Adaptive Clustering Hierarchy (LEACH), Dual Homed Routing (DHR) and Informer Homed Routing (IHR) through simulation.","PeriodicalId":152357,"journal":{"name":"Int. J. Rough Sets Data Anal.","volume":"39 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":"131934353","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Probability Based Most Informative Gene Selection From Microarray Data","authors":"Sunanda Das, A. Das","doi":"10.4018/IJRSDA.2018010101","DOIUrl":"https://doi.org/10.4018/IJRSDA.2018010101","url":null,"abstract":"Microarraydatasetshaveawideapplication inbioinformatics research.Analysis tomeasure the expressionlevelofthousandsofgenesofthiskindofhigh-throughputdatacanhelpforfindingthe causeandsubsequenttreatmentofanydisease.Therearemanytechniquesingeneanalysistoextract biologicallyrelevantinformationfrominconsistentandambiguousdata.Inthispaper,theconceptsof functionaldependencyandclosureofanattributeofdatabasetechnologyareusedforfindingthemost importantsetofgenesforcancerdetection.Firstly,themethodcomputessimilarityfactorbetween eachpairofgenes.Basedonthesimilarityfactorsasetofgenedependencyisformedfromwhich closuresetisobtained.Subsequently,conditionalprobabilitybasedinterestingnessmeasurementsare usedtodeterminethemostinformativegenefordiseaseclassification.Theproposedmethodisapplied onsomepubliclyavailablecancerousgeneexpressiondataset.Theresultshowstheeffectiveness androbustnessofthealgorithm. KeywoRDS Important Gene Set, Most Informative Gene Selection, Probability Factor, Similarity Based Gene Dependency","PeriodicalId":152357,"journal":{"name":"Int. J. Rough Sets Data Anal.","volume":"39 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":"125820034","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}
U. Giani, Carmine Garzillo, Brankica Pavic, Margaret Piscitelli
{"title":"Illness Narrative Complexity in Right and Left-Hemisphere Lesions","authors":"U. Giani, Carmine Garzillo, Brankica Pavic, Margaret Piscitelli","doi":"10.4018/IJRSDA.2016010103","DOIUrl":"https://doi.org/10.4018/IJRSDA.2016010103","url":null,"abstract":"Human relations are mainly based upon the exchange of narratives. So, it seems reasonable to study the effects of cerebral injuries upon this essential function of human thinking, and in particualr the differences of the structure of narratives in patients affected by left and right cerebral lesions. In this paper the transcripts of audio-taped illness narratives of six enrolled patients three with right-hemisphere lesions and three with left ones, matched by age and sex were analyzed by means of two different methods: Semantic Networks Analysis and Latent Dirichlet Allocation. These methods allowed to calculate several numerical indicators of the complexity of the narratives. Results showed that right hemisphere lesions entail a reduction of the narrative complexity, whereas the opposite occurs in patients with Left Hemisphere Lesion.","PeriodicalId":152357,"journal":{"name":"Int. J. Rough Sets Data Anal.","volume":"142 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134530091","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Information Systems on Hesitant Fuzzy Sets","authors":"D. Deepak, S. J. John","doi":"10.4018/IJRSDA.2016010105","DOIUrl":"https://doi.org/10.4018/IJRSDA.2016010105","url":null,"abstract":"Knowledge extraction from information systems is one of the most significant problems in artificial intelligence. This paper attempts to study information systems in the hesitant fuzzy domain. It studies information systems which has a set of possible membership values. Illustration of a case is provided where the hesitant membership values are arrived at from attribute values whose membership values are a family of sets. The membership value here would turn out to be a subset of the power set of membership values from the usual information system. Although it does not mean that it is arrived at from usual information systems. Reduct, core, relative reduct, relative core and the corresponding indiscernibility matrices are also studied. Apart from these, paper also discusses the homomorphisms between hesitant information systems. For two homomorphic information systems the reduct and core of one information system are the corresponding images of the reduct and core of the other information system under this homomorphism.","PeriodicalId":152357,"journal":{"name":"Int. J. Rough Sets Data Anal.","volume":"27 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133267247","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Study on Bayesian Decision Theoretic Rough Set","authors":"S. Halder","doi":"10.4018/ijrsda.2014010101","DOIUrl":"https://doi.org/10.4018/ijrsda.2014010101","url":null,"abstract":"The concept of rough set was first developed by Pawlak (1982). After that it has been successfully applied in many research fields, such as pattern recognition, machine learning, knowledge acquisition, economic forecasting and data mining. But the original rough set model cannot effectively deal with data sets which have noisy data and latent useful knowledge in the boundary region may not be fully captured. In order to overcome such limitations, some extended rough set models have been put forward which combine with other available soft computing technologies. Many researchers were motivated to investigate probabilistic approaches to rough set theory. Variable precision rough set model (VPRSM) is one of the most important extensions. Bayesian rough set model (BRSM) (Slezak & Ziarko, 2002), as the hybrid development between rough set theory and Bayesian reasoning, can deal with many practical problems which could not be effectively handled by original rough set model. Based on Bayesian decision procedure with minimum risk, Yao (1990) puts forward a new model called decision theoretic rough set model (DTRSM) which brings new insights into the probabilistic approaches to rough set theory. Throughout this paper, the concept of decision theoretic rough set is studied and also a new concept of Bayesian decision theoretic rough set is introduced. Lastly a comparative study is done between Bayesian decision theoretic rough set and Rough set defined by Pawlak (1982).","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":"122112143","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Performance Analysis of Hard and Soft Clustering Approaches For Gene Expression Data","authors":"P. K. N. Banu, S. Andrews","doi":"10.4018/ijrsda.2015010104","DOIUrl":"https://doi.org/10.4018/ijrsda.2015010104","url":null,"abstract":"Mining gene expression data is growing rapidly to predict gene expression patterns and assist clinicians in early diagnosis of tumor formation. Clustering gene expression data is the most important phase, helps in finding group of genes that are highly expressed and suppressed. This paper analyses the performance of most representative hard and soft off-line clustering algorithms: K-Means, Fuzzy C-Means, Self Organizing Maps SOM based clustering and Genetic Algorithm GA based clustering for brain tumor gene expression dataset. Clusters produced by the clustering algorithms are the indications of the cellular processes. Clustering results are evaluated using clustering indices such as Xie-Beni index XB, Davies-Bouldin index DB, Mean Absolute Error MAE, Root Mean Squared Error RMSE and Dunn's Index DI along with the time taken to find the compactness and separation of clusters. Experimental results prove soft clustering approaches works well to predict clusters of highly expressed and suppressed genes.","PeriodicalId":152357,"journal":{"name":"Int. J. Rough Sets Data Anal.","volume":"41 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":"125997669","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}