Sharif Digital Repository

In this research, a novel approach is developed to predict stocks return and risks. In this three stage method, through a comprehensive investigation all possible features which can be effective on stocks risk and return are identified. Then, in the next stage risk and return are predicted by applying data mining techniques for the given features. Finally, we develop a hybrid algorithm, on the basis of filter and function-based clustering; the important features in risk and return prediction are selected then risk and return re-predicted. The results show that the proposed hybrid model is a proper tool for effective feature selection and these features are good indicators for the prediction... 

In this paper we propose a new automatic method for discriminating original and tampered images based on 'JPEG ghost detection' method, which is a subset of format-based image forensics approaches. The inconsistency of quality factors indicates that the photo is a composite one created from at least two different cameras and therefore it is a manipulated photo. Our classification algorithm first extracts the ghost border. Then the image is classified as original or tampered groups by thresholding a distance in feature space. © 2016 IEEE  

This paper presents a new interpretable fuzzy classification system. Simulated annealing heuristic is employed to effectively investigate the large search space usually associated with classification problem. Here, two criteria are used to evaluate the proposed method. The first criterion is accuracy of extracted fuzzy if-then rules, and the other is comprehensibility of obtained rules. Experiments are performed with some data sets from UCI machine learning repository. Results are compared with several well-known classification algorithms, and show that the proposed approach provides more accurate and interpretable classification system. © 2009 IEEE  

Protein mass spectra pattern recognition is a new forum in which many machine learning algorithms have been conducted to enhance the chance of early cancer diagnosis. The high-dimensionality-small-sample (HDSS) problem of cancer proteomic datasets still requires more sophisticated approaches to improve the classification accuracy. In this study we present a simple ensemble strategy based on measuring the generalizing capability of different subsets of training data and apply it in making final decision. Using a limited number of biomarkers along with 5 classification algorithms, the proposed method achieved a promising performance over a well-known prostate cancer mass spectroscopy dataset.... 

Steady blood flow through a circular artery with rigid walls is studied by COSSERAT Continuum Mechanical Approach. To obtain the additional viscosities coefficients, feed forward multi-layer perceptron (MLP) type of artificial neural networks (ANN) and the results obtained in previous empirical works is used. The governing filed equations are derived and solution to the Hagen-Poiseuilli flow of a COSSERAT fluid in the artery is obtained analytically by Homotopy Perturbation Method (HPM) and numerically using finite difference method. Comparison of analytical results with numerical ones showed excellent agreement. In addition microrotation and the velocity profile along the radius are... 

Incremental learning has been used extensively for data stream classification. Most attention on the data stream classification paid on non-evolutionary methods. In this paper, we introduce new incremental learning algorithms based on harmony search. We first propose a new classification algorithm for the classification of batch data called harmony-based classifier and then give its incremental version for classification of data streams called incremental harmony-based classif ier. Finally, we improve it to reduce its computational overhead in absence of drifts and increase its robustness in presence of noise. This improved version is called improved incremental harmony-based classifier. The... 

Handling recurring concepts has become of interest as a challenging problem in the field of data stream classification in recent years. One main feature of data streams is that they appear in nonstationary environments. This means that the concept which the data are drawn from, changes over the time. If after a long enough time, the concept reverts to one of the previous concepts, it is said that recurring concepts has occurred. One solution to this challenge is to maintain a pool of classifiers, each representing a concept in the stream. This paper follows this approach and holds an ensemble of classifiers for each concept. As for each received batch of data, a new classifier is created;... 

Denoising is an important preprocessing stage in some ElectroEncephaloGraphy (EEG) applications. For this purpose, Blind Source Separation (BSS) methods, such as Independent Component Analysis (ICA) and Decorrelated and Colored Component Analysis (DCCA), are commonly used. Although ICA and DCCA-based methods are powerful tools to extract sources of interest, the procedure of eliminating the effect of sources of non-interest is usually manual. It should be noted that some methods for automatic selection of artifact sources after BSS methods exist, although they imply a training supervised step. On the other hand, in cases where there are some a prioriinformation about the subspace of... 

Widespread growth in Android malware stimulates security researchers to propose different methods for analyzing and detecting malicious behaviors in applications. Nevertheless, current solutions are ill-suited to extract the fine-grained behavior of Android applications accurately and efficiently. In this paper, we propose ServiceMonitor, a lightweight host-based detection system that dynamically detects malicious applications directly on mobile devices. ServiceMonitor reconstructs the fine-grained behavior of applications based on their interaction with system services (i.e. SMS manager, camera, wifi networking, etc). ServiceMonitor monitors the way applications request system services in... 

Adaptive application detection in today's high-bandwidth networks is resource consuming and inaccurate due to the high volume, velocity, and variety characteristics of the networks traffic. To generate a robust classifier for identifying applications over encrypted traffic, we proposed DSCA as a DPI-based Stream Classification Algorithm. DSCA utilizes applications detected by the DPI, Deep Packet Inspection technique, as ground truth data and updates the classification model accordingly. To reduce the classification algorithms overhead without accuracy reduction, a feature selection method, named CfsSubsetEval, is deployed in DSCA. The proposed approach is implemented via the MOA tool and... 

Objective: A novel electrocardiogram (ECG) classification algorithm is proposed for continuous cardiac monitoring on wearable devices with limited processing capacity. Methods: The proposed solution employs a novel architecture consisting of wavelet transform and multiple long short-term memory (LSTM) recurrent neural networks (see Fig. 1). Results: Experimental evaluations show superior ECG classification performance compared to previous works. Measurements on different hardware platforms show the proposed algorithm meets timing requirements for continuous and real-time execution on wearable devices. Conclusion: In contrast to many compute-intensive deep-learning based approaches, the... 

A total of 21 833 inhibitors of the central nervous system (CNS) were collected from Binding-database and analyzed using discriminant analysis (DA) techniques. A combination of genetic algorithm and quadratic discriminant analysis (GA-QDA) was proposed as a tool for the classification of molecules based on their therapeutic targets and activities. The results indicated that the one-against-one (OAO) QDA classifiers correctly separate the molecules based on their therapeutic targets and are comparable with support vector machines. These classifiers help in charting the chemical space of the CNS inhibitors and finding specific subspaces occupied by particular classes of molecules. As a next... 

The existing learning methods usually assume that training data and test data follow the same distribution, while this is not always true. Thus, in many cases the performance of these methods on the test data will be severely degraded. In this paper, we study the problem of unsupervised domain adaptation, where no labeled data in the target domain is available. The proposed method first finds a new representation for both the source and the target domain and then learns a prediction function for the classifier by optimizing an objective function which simultaneously tries to minimize the loss function on the source domain while also maximizes the consistency of manifold (which is based on... 

Data classification in large scale systems, such as peer-to-peer networks, can be very communication-expensive and impractical due to the huge amount of available data and lack of central control. Frequent data updates pose even more difficulties when applying existing classification techniques in peer-to-peer networks. We propose a distributed, scalable and robust classification algorithm based on k-nearest neighbor estimation. Our algorithm is asynchronous, considers data updates and imposes low communication overhead. The proposed method uses a content based overlay structure to organize data and moderate the number of query messages propagated in the network. Simulation results show that... 

Cellular learning automata (CLA) is a distributed computational model which was introduced in the last decade. This model combines the computational power of the cellular automata with the learning power of the learning automata. Cellular learning automata is composed from a lattice of cells working together to accomplish their computational task; in which each cell is equipped with some learning automata. Wide range of applications utilizes CLA such as image processing, wireless networks, evolutionary computation and cellular networks. However, the only input to this model is a reinforcement signal and so it cannot receive another input such as the state of the environment. In this paper,... 

Fuzzy techniques can be used for accurate and high-speed modeling as well as for the control of complex systems, but various challenging problems are usually encountered during their actual implementation. For example, the variable parameters need to be optimized iteratively during the training phase, where this process is inspired by crisp domain algorithms. However, in recent years, memristor-based structures have emerged as another promising method for implementing neural network structures and fuzzy algorithms. In this study, we propose a novel adaptive and real-time fuzzy modeling algorithm, which employs the active learning method concept to mimic the functionality of the brain's right... 

Characteristics and way of behavior of attacks and infiltrators on computer networks are usually very difficult and need an expert. In addition; the advancement of computer networks, the number of attacks and infiltrations is also increasing. In fact, the knowledge coming from expert will lose its value over time and must be updated and made available to the system and this makes the need for expert person always felt. In machine learning techniques, knowledge is extracted from the data itself which has diminished the role of the expert. Various methods used to detect intrusions, such as statistical models, safe system approach, neural networks, etc., all weaken the fact that it uses all the... 

Background and Objectives: Melanoma is a dangerous kind of skin disease with a high death rate, and its prevalence has increased rapidly in recent years. Diagnosis of melanoma in a primary phase can be helpful for its cure. Due to costs for dermatology, we need an automatic system to diagnose melanoma through lesion images. Methods: Here, we propose a sparse representation based method for segmentation and classification of lesion images. The main idea of our framework is based on a kernel sparse representation, which produces discriminative sparse codes to represent features in a high-dimensional feature space. Our novel formulation for discriminative kernel sparse coding jointly learns a...