Sharif Digital Repository

The ability to accurately classify temporal relation between events is an important task for a large number of natural language processing applications such as Question Answering (QA), Summarization, and Information Extraction. This paper presents a weakly-supervised machine learning approach for classification of temporal relation between events. In the first stage, the algorithm learns a general classifier from an annotated corpus. Then, it applies the hypothesis of "one type of temporal relation per discourse" and expands the scope of "discourse" from a single document to a cluster of topically-related documents. By combining the global information of such a cluster with local decisions... 

In this paper, we propose a novel density-based fuzzy clustering algorithm based on Active Learning Method (ALM), which is a methodology of soft computing inspired by some hypotheses claiming that human brain interprets information in pattern-like images rather than numerical quantities. The proposed clustering algorithm, Fuzzy Unsupervised Active Learning Method (FUALM), is performed in two main phases. First, each data point spreads in the feature space just like an ink drop that spreads on a sheet of paper. As a result of this process, densely connected ink patterns are formed that represent clusters. In the second phase, a fuzzifying process is applied in order to summarize the effects... 

This study introduces a new identifier for nuclear power plants (NPPs) transients. The proposed identifier performs its function in two steps. First, the transient is identified by the previously developed supervised classifier combining ARIMA model and EBP algorithm. In the second step, the patterns of unknown transients are fed to the identifier based on the semi-supervised learning (SSL). The transductive support vector machine (TSVM) as a semi-supervised algorithm is trained by the labeled data of transients to predict some unlabeled data. The labeled and newly predicted data is then used to train the TSVM for another portion of unlabeled data. Training and prediction is continued until... 

This paper combines the cryptanalysis of RC4 and Data mining algorithm. It analyzes RC4 by Data mining algorithm (J48) for the first time and discloses more vulnerabilities of RC4. The motivation for this paper is combining Artificial Intelligence and Machine learning with cryptography to decrypt cyphertext in the shortest possible time. This analysis shows that lots of numbers in RC4 during different permutations and substitutions do not change their positions and are fixed in their places. This means KSA and PRGA are bad shuffle algorithms. In this method, the information theory and Decision trees are used which are very powerful for solving hard problems and extracting information from... 

The Stochastic Distribution Control (SDC) problem is a generalised form of the minimum variance control problem where non-Gaussian noise distributions are encountered. The problem has been previously solved using two alternative approaches. When it is assumed that the output Probability Distribution Function (PDF) is measurable, then a parameterized controller is obtained. If on the other hand this assumption is removed (which corresponds to most practical cases), then the controller found is no longer parameterisable (i.e. it is a control action sequence). Both these approaches have thus far been solved using local Newtonian methods. In this paper a third alternative is presented which... 

Spectral manifold learning techniques have recently found extensive applications in machine vision. The common strategy of spectral algorithms for manifold learning is exploiting the local relationships in a symmetric adjacency graph, which is typically constructed using k-nearest neighborhood (k-NN) criterion. In this paper, with our focus on locally linear embedding as a powerful and well-known spectral technique, shortcomings of k-NN for construction of the adjacency graph are first illustrated, and then a new criterion, namely k/K-nearest neighborhood (k/K-NN) is introduced to overcome these drawbacks. The proposed criterion involves finding the sparsest representation of each sample in... 

Inference and Estimation in Missing Information (MI) scenarios are important topics in Statistical Learning Theory and Machine Learning (ML). In ML literature, attempts have been made to enhance prediction through precise feature selection methods. In sparse linear models, LASSO is well-known in extracting the desired support of the signal and resisting against noisy systems. When sparse models are also suffering from MI, the sparse recovery and inference of the missing models are taken into account simultaneously. In this paper, we will introduce an approach which enjoys sparse regression and covariance matrix estimation to improve matrix completion accuracy, and as a result enhancing... 

In this paper, we propose a novel density-based fuzzy clustering algorithm based on Active Learning Method (ALM), which is a methodology of soft computing inspired by some hypotheses claiming that human brain interprets information in pattern-like images rather than numerical quantities. The proposed clustering algorithm, Fuzzy Unsupervised Active Learning Method (FUALM), is performed in two main phases. First, each data point spreads in the feature space just like an ink drop that spreads on a sheet of paper. As a result of this process, densely connected ink patterns are formed that represent clusters. In the second phase, a fuzzifying process is applied in order to summarize the effects... 

In this paper, an extension of the recently developed Crow Search Algorithm (CSA) to multi-objective optimization problems is presented. The proposed algorithm, called Multi-Objective Crow Search Algorithm (MOCSA), defines the fitness function using a set of determined weight vectors, employing the max-min strategy. In order to improve the efficiency of the search space, the performance space is regionalized using specific control points. A new chasing operator is also employed in order to improve the convergence process. Numerical results show that MOCSA is closely comparable to well-known multi-objective algorithms. © 2017 IEEE  

Traditional learning algorithms cannot perform well in scenarios where training data (source domain data) that are used to learn the model have a different distribution with test data (target domain data). The domain adaptation that intends to compensate this problem is an important capability for an intelligent agent. This paper presents a domain adaptation method which learns to adapt the data distribution of the source domain to that of the target domain where no labeled data of the target domain is available (and just unlabeled data are available for the target domain). Our method jointly learns a low dimensional representation space and an adaptive classifier. In fact, we try to find a... 

In this paper the Unsupervised Active Learning Method (UALM), a novel clustering method based on the Active Learning Method (ALM) is introduced. ALM is an adaptive recursive fuzzy learning algorithm inspired by some behavioral features of human brain functionality. UALM is a density-based clustering algorithm that relies on discovering densely connected components of data, where it can find clusters of arbitrary shapes. This approach is a noise-robust clustering method. The algorithm first blurs the data points as ink drop patterns, then summarizes the effects of all data points, and finally puts a threshold on the resulting pattern. It uses the connected-component algorithm for finding... 

We develop a heuristic procedure for solving the discrete time/resource trade-off problem in the field of project scheduling. In this problem, a project contains activities interrelated by finish-start-type precedence constraints with a time lag of zero, which require one or more constrained renewable resources. Each activity has a specified work content and can be performed in different modes, i.e. with different durations and resource requirements, as long as the required work content is met. The objective is to schedule each activity in one of its modes in order to minimize the project makespan. We use a scatter search algorithm to tackle this problem, using path relinking methodology as... 

This paper introduces an incremental local learning algorithm inspired by learning in neurobiological systems. This algorithm has no training phase and learns the world during operation, in a lifetime manner. It is a semi-supervised algorithm which combines soft competitive learning in input space and linear regression with recursive update in output space. This method is also robust to negative interference and compromises bias-variance dilemma. These qualities make the learning method a good nonlinear function approximator having possible applications in neuro-robotic systems. Some simulations illustrate the effectiveness of the proposed algorithm in function approximation, time-series... 

There is a great deal of interest in the manufacturing industry for quantitative measures of process performance with multiple quality characteristics. Unfortunately, multivariate process capability indices that are currently employed, except for a handful of cases, depend intrinsically on the underlying data being normally distributed. In this paper, we propose a general multivariate capability index based on the Mahanalobis distance, which is very easy to use. We also approximate the distribution of these distances by the Burr XII distribution and then estimate its parameters using a simulated annealing search algorithm. Finally, we give an example, based on real manufacturing process... 

Spectral manifold learning techniques have recently found extensive applications in machine vision. The common strategy of spectral algorithms for manifold learning is exploiting the local relationships in a symmetric adjacency graph, which is typically constructed using k -nearest neighborhood (k-NN) criterion. In this paper, with our focus on locally linear embedding as a powerful and well-known spectral technique, shortcomings of k-NN for construction of the adjacency graph are first illustrated, and then a new criterion, namely k/K-nearest neighborhood (k/K-NN) is introduced to overcome these drawbacks. The proposed criterion involves finding the sparsest representation of each sample in... 

Hierarchical reinforcement learning (HRL) has had a vast range of applications in recent years. Preparing mechanisms for autonomous acquisition of skills has been a main topic of research in this area. While different methods have been proposed to achieve this goal, few methods have been shown to be successful both in performance and also efficiency in terms of time complexity of the algorithm. In this paper, a linear time algorithm is proposed to find subgoal states of the environment in early episodes of learning. Having subgoals available in early phases of a learning task, results in building skills that dramatically increase the convergence rate of the learning process. © 2009 Springer... 

In order to plan precise treatment or accurate tumor removal surgery, brain tumor segmentation is critical for detecting all parts of tumor and its surrounding tissues. To visualize brain anatomy and detect its abnormalities, we use multi-modal Magnetic Resonance Imaging (MRI) as input. This paper introduces an efficient and automated algorithm based on the 3D bit-plane neighborhood concept for Brain Tumor segmentation using a rule-based learning algorithm. In the proposed approach, in addition to using intensity values in each slice, we consider sets of three consecutive slices to extract information from 3D neighborhood. We construct a Rule base using sequential covering algorithm. Through... 

Demand response (DR) and flexible AC transmission system (FACTS) devices can be effectively used for congestion management in power transmission systems. However, demand response program (DRP) implementation can itself affect the optimum location of FACTS devices, which is one of the main issues in power system planning. This paper investigates the impact of DRPs on unified power flow controller (UPFC) placement. The harmony search algorithm is employed to determine the optimum locations and parameter setting of UPFC in a long-term framework. The optimization problem is solved with different objectives including generation and congestion cost reduction, as well as loss reduction. In this... 

In this paper, exergy analysis of a steam power plant located in southern Iran named Zarand power plant has been studied. In order to optimize the performance of the Rankine cycle and achieve higher exergy efficiency, several parameters have been considered as decision variables. Knowing that there is the ability to change some of the parameters in the specific range in the process of electricity production in power plant, temperature and output pressure of the boiler and output pressure of four steps of extraction turbine have been selected as six decision variables. Also, exergy efficiency has been considered as the objective function. For this purpose, the exergy efficiency of the system... 

In order to plan precise treatment or accurate tumor removal surgery, brain tumor segmentation is critical for detecting all parts of tumor and its surrounding tissues. To visualize brain anatomy and detect its abnormalities, we use multi-modal Magnetic Resonance Imaging (MRI) as input. This paper introduces an efficient and automated algorithm based on the 3D bit-plane neighborhood concept for Brain Tumor segmentation using a rule-based learning algorithm. In the proposed approach, in addition to using intensity values in each slice, we consider sets of three consecutive slices to extract information from 3D neighborhood. We construct a Rule base using sequential covering algorithm. Through...