A Model for Cross-Domain Opinion Target Extraction in Sentiment Analysis

Opinion target extraction is one of the core tasks in sentiment analysis on text data. In recent years, dependency parser–based approaches have been commonly studied for opinion target extraction. However, dependency parsers are limited by language and grammatical constraints. Therefore, in this work, a sequential pattern-based rule mining model, which does not have such constraints, is proposed for cross-domain opinion target extraction from product reviews in unknown domains. Thus, knowing the domain of reviews while extracting opinion targets becomes no longer a requirement. The proposed model also reveals the difference between the concepts of opinion target and aspect, which are commonly confused in the literature. The model consists of two stages. In the first stage, the aspects of reviews are extracted from the target domain using the rules automatically generated from source domains. The aspects are also transferred from the source domains to a target domain. Moreover, aspect pruning is applied to further improve the performance of aspect extraction. In the second stage, the opinion target is extracted among the aspects extracted at the former stage using the rules automatically generated for opinion target extraction. The proposed model was evaluated on several benchmark datasets in different domains and compared against the literature. The experimental results revealed that the opinion targets of the reviews in unknown domains can be extracted with higher accuracy than those of the previous works.     

Handling Updates and Crashes in VoD Systems

Though there have been several recent efforts to develop disk based video servers, these approaches have all ignored the topic of updates and disk server crashes. In this paper, we present a priority based model for building video servers that handle two classes of events: user events that could include enter, play, pause, rewind, fast-forward, exit, as well assystem events such as insert, delete, server-down, server-up that correspond to uploading new movie blocks onto the disk(s), eliminating existing blocks from the disk(s), and/or experiencing a disk server crash. We will present algorithms to handle such events. Our algorithms are provably correct, and computable in polynomial time. Furthermore, we guarantee that under certain reasonable conditions, continuing clients experience jitter free presentations. We further justify the efficiency of our techniques with a prototype implementation and experimental results.     

Distributed Learning for Planning Under Uncertainty Problems with Heterogeneous Teams

This paper considers the problem of multiagent sequential decision making under uncertainty and incomplete knowledge of the state transition model. A distributed learning framework, where each agent learns an individual model and shares the results with the team, is proposed. The challenges associated with this approach include choosing the model representation for each agent and how to effectively share these representations under limited communication. A decentralized extension of the model learning scheme based on the Incremental Feature Dependency Discovery (Dec-iFDD) is presented to address the distributed learning problem. The representation selection problem is solved by leveraging iFDD’s property of adjusting the model complexity based on the observed data. The model sharing problem is addressed by having each agent rank the features of their representation based on the model reduction error and broadcast the most relevant features to their teammates. The algorithm is tested on the multi-agent block building and the persistent search and track missions. The results show that the proposed distributed learning scheme is particularly useful in heterogeneous learning setting, where each agent learns significantly different models. We show through large-scale planning under uncertainty simulations and flight experiments with state-dependent actuator and fuel-burn- rate uncertainty that our planning approach can outperform planners that do not account for heterogeneity between agents.     

A minisum location problem with regional demand considering farthest Euclidean distances

We consider a continuous multi-facility location-allocation problem that aims to minimize the sum of weighted farthest Euclidean distances between (closed convex) polygonal and/or circular demand regions, and facilities they are assigned to. We show that the single facility version of the problem has a straightforward second-order cone programming formulation and can therefore be efficiently solved to optimality. To solve large size instances, we adapt a multi-dimensional direct search descent algorithm to our problem which is not guaranteed to find the optimal solution. In a special case with circular and rectangular demand regions, this algorithm, if converges, finds the optimal solution. We also apply a simple subgradient method to the problem. Furthermore, we review the algorithms proposed for the problem in the literature and compare all these algorithms in terms of both solution quality and time. Finally, we consider the multi-facility version of the problem and model it as a mixed integer second-order cone programming problem. As this formulation is weak, we use the alternate location-allocation heuristic to solve large size instances.     

Effect of Messaging Model on the Reliable Data Transfer Latency in a Fog System

Journal of Network and Systems Management - IoT applications have become a pillar for enhancing the quality of life. However, the increasing amount of data generated by IoT devices places pressure...     

A novel automatic suspicious mass regions identification using Havrda & Charvat entropy and Otsu's N thresholding

Mass detection is a very important process for breast cancer diagnosis and computer aided systems. It can be very complex when the mass is small or invisible because of dense breast tissue. Therefore, the extraction of suspicious mass region can be very challenging. This paper proposes a novel segmentation algorithm to identify mass candidate regions in mammograms. The proposed system includes three parts: breast region and pectoral muscle segmentation, image enhancement and suspicious mass regions identification. The first two parts have been examined in previous studies. In this study, we focused on suspicious mass regions identification using a combination of Havrda & Charvat entropy method and Otsu's N thresholding method. An open access Mammographic Image Analysis Society (MIAS) database, which contains 59 masses, was used for the study. The proposed system obtained a 93% sensitivity rate for suspicious mass regions identification in 56 abnormal and 40 normal images.     

Comparison of different classifier algorithms for diagnosing macular and optic nerve diseases

Abstract: The aim of this research was to compare classifier algorithms including the C4.5 decision tree classifier, the least squares support vector machine (LS-SVM) and the artificial immune recognition system (AIRS) for diagnosing macular and optic nerve diseases from pattern electroretinography signals. The pattern electroretinography signals were obtained by electrophysiological testing devices from 106 subjects who were optic nerve and macular disease subjects. In order to show the test performance of the classifier algorithms, the classification accuracy, receiver operating characteristic curves, sensitivity and specificity values, confusion matrix and 10-fold cross-validation have been used. The classification results obtained are 85.9%, 100% and 81.82% for the C4.5 decision tree classifier, the LS-SVM classifier and the AIRS classifier respectively using 10-fold cross-validation. It is shown that the LS-SVM classifier is a robust and effective classifier system for the determination of macular and optic nerve diseases.     

An adaptive support vector regressor controller for nonlinear systems

In this study, a novel online support vector regressor (SVR) controller based on system model estimated by a separate online SVR is proposed. The main idea is to obtain an SVR controller based on an estimated model of the system by optimizing the margin between reference input and system output. For this purpose, “closed-loop margin” which depends on tracking error is defined, then the parameters of the SVR controller are optimized so as to optimize the closed-loop margin and minimize the tracking error. In order to construct the closed-loop margin, the model of the system estimated by an online SVR is utilized. The parameters of the SVR controller are adjusted via the SVR model of system. The stability of the closed-loop system has also been analyzed. The performance of the proposed method has been evaluated by simulations carried out on a continuously stirred tank reactor (CSTR) and a bioreactor, and the results show that SVR model and SVR controller attain good modeling and control performances.