20,045 research outputs found

    An agent-driven semantical identifier using radial basis neural networks and reinforcement learning

    Full text link
    Due to the huge availability of documents in digital form, and the deception possibility raise bound to the essence of digital documents and the way they are spread, the authorship attribution problem has constantly increased its relevance. Nowadays, authorship attribution,for both information retrieval and analysis, has gained great importance in the context of security, trust and copyright preservation. This work proposes an innovative multi-agent driven machine learning technique that has been developed for authorship attribution. By means of a preprocessing for word-grouping and time-period related analysis of the common lexicon, we determine a bias reference level for the recurrence frequency of the words within analysed texts, and then train a Radial Basis Neural Networks (RBPNN)-based classifier to identify the correct author. The main advantage of the proposed approach lies in the generality of the semantic analysis, which can be applied to different contexts and lexical domains, without requiring any modification. Moreover, the proposed system is able to incorporate an external input, meant to tune the classifier, and then self-adjust by means of continuous learning reinforcement.Comment: Published on: Proceedings of the XV Workshop "Dagli Oggetti agli Agenti" (WOA 2014), Catania, Italy, Sepember. 25-26, 201

    Predictive based hybrid ranker to yield significant features in writer identification

    Get PDF
    The contribution of writer identification (WI) towards personal identification in biometrics traits is known because it is easily accessible, cheaper, more reliable and acceptable as compared to other methods such as personal identification based DNA, iris and fingerprint. However, the production of high dimensional datasets has resulted into too many irrelevant or redundant features. These unnecessary features increase the size of the search space and decrease the identification performance. The main problem is to identify the most significant features and select the best subset of features that can precisely predict the authors. Therefore, this study proposed the hybridization of GRA Features Ranking and Feature Subset Selection (GRAFeSS) to develop the best subsets of highest ranking features and developed discretization model with the hybrid method (Dis-GRAFeSS) to improve classification accuracy. Experimental results showed that the methods improved the performance accuracy in identifying the authorship of features based ranking invariant discretization by substantially reducing redundant features

    An improvement in support vector machine classification model using grey relational analysis for cancer diagnosis

    Get PDF
    To further improve the accuracy of classifier for cancer diagnosis, a hybrid model called GRA-SVM which comprises Support Vector Machine classifier and filter feature selection Grey Relational Analysis is proposed and tested against Wisconsin Breast Cancer Dataset (WBCD) and BUPA Disorder Dataset. The performance of GRA-SVM is compared to SVM’s in terms of accuracy, sensitivity, specificity and Area under Curve (AUC). The experimental results reveal that GRA-SVM improves the SVM accuracy of about 0.48 by using only two features for the WBCD dataset. For BUPA dataset, GRA-SVM improves the SVM accuracy of about 0.97 by using four features. Besides improving the accuracy performance, GRA-SVM also produces a ranking scheme that provides information about the priority of each feature. Therefore, based on the benefits gained, GRA-SVM is recommended as a new approach to obtain a better and more accurate result for cancer diagnosis

    Desirable properties for XML update mechanisms

    Get PDF
    The adoption of XML as the default data interchange format and the standardisation of the XPath and XQuery languages has resulted in significant research in the development and implementation of XML databases capable of processing queries efficiently. The ever-increasing deployment of XML in industry and the real-world requirement to support efficient updates to XML documents has more recently prompted research in dynamic XML labelling schemes. In this paper, we provide an overview of the recent research in dynamic XML labelling schemes. Our motivation is to define a set of properties that represent a more holistic dynamic labelling scheme and present our findings through an evaluation matrix for most of the existing schemes that provide update functionality

    Integrated analytical hierarchy process and grey relational analysis approach to measure supply chain complexity

    Get PDF
    Purpose – The purpose of this paper is to understand the drivers that create complexity in the supply chain and develop a mathematical model to measure the level of supply chain complexity (SCC). Design/Methodology/Approach of the paper – Through extensive literature review, we discussed various drivers of SCC. These drivers were classified into five dimensions based on expert opinion. Moreover, a novel hybrid mathematical model was developed by integrating analytical hierarchy process (AHP) and grey relational analysis (GRA) methods to measure the level of SCC. A case study was conducted to demonstrate the applicability of the developed model and analyze the SCC level of the company in the study. Findings – We identified twenty-two drivers of SCC, which were further clustered into five complexity dimensions. The application of the developed model to the company in the case study showed that the SCC level of the company was 0.44, signifying that there was a considerable scope of improvement in terms of minimizing complexity. The company that serves as the focus of this case study mainly needs improvement in tackling issues concerning government regulation, internal communication and information sharing, and company culture. Originality/Value – In this paper, we propose a model by integrating AHP and GRA methods that can measure the SCC level based on various complexity drivers. The combination of such methods, considering their ability to convert the inheritance and interdependence of drivers into a single mathematical model, is preferred over other techniques. To the best of the authors’ knowledge, this is the first attempt at developing a hybrid multicriteria decision-based model to quantify SCC.© 2020 Emerald Publishing Limited. This manuscript version is made available under the Creative Commons Attribution–NonCommercial 4.0 International (CC BY–NC 4.0) license, https://creativecommons.org/licenses/by-nc/4.0/fi=vertaisarvioitu|en=peerReviewed

    Applications of Internet of Things

    Get PDF
    This book introduces the Special Issue entitled “Applications of Internet of Things”, of ISPRS International Journal of Geo-Information. Topics covered in this issue include three main parts: (I) intelligent transportation systems (ITSs), (II) location-based services (LBSs), and (III) sensing techniques and applications. Three papers on ITSs are as follows: (1) “Vehicle positioning and speed estimation based on cellular network signals for urban roads,” by Lai and Kuo; (2) “A method for traffic congestion clustering judgment based on grey relational analysis,” by Zhang et al.; and (3) “Smartphone-based pedestrian’s avoidance behavior recognition towards opportunistic road anomaly detection,” by Ishikawa and Fujinami. Three papers on LBSs are as follows: (1) “A high-efficiency method of mobile positioning based on commercial vehicle operation data,” by Chen et al.; (2) “Efficient location privacy-preserving k-anonymity method based on the credible chain,” by Wang et al.; and (3) “Proximity-based asynchronous messaging platform for location-based Internet of things service,” by Gon Jo et al. Two papers on sensing techniques and applications are as follows: (1) “Detection of electronic anklet wearers’ groupings throughout telematics monitoring,” by Machado et al.; and (2) “Camera coverage estimation based on multistage grid subdivision,” by Wang et al
    corecore