Sharif Digital Repository

Several metrics have been proposed for recognition of relationships between elements of two Ontologies. Many of these methods select a number of such metrics and combine them to extract existing mappings. In this article, we present a method for selection of more effective metrics - based on data mining techniques. Furthermore, by having a set of metrics, we suggest a data-mining-like means for combining them into a better ontology alignment  

Nowadays, due to the growing role that analytical, predictive and decision making activities perform in organizations, organizational data are very important. In order to utilizing organizational data, it should be transmitted from the operational and transactional environment to a dimensional or normal database. However, not only differences in platforms and data types are some issues that should be overcome, but also variety of data types such as non-structural and text format files should be considered. In this way, exploiting updated data storages is necessary for quick and accurate services and raising customers' satisfaction. Although real time data storages are frequently used in... 

In this investigation, the idea of Visual Working Memory (VWM) mechanism modeling based on versatile fuzzy method; Active Learning method, is presented. Visual information process; retrieving and learning rely on the use of Ink Drop Spread (IDS) and Center of Gravity (COG) as spatial density convergence operators. IDS modeling is characterized by processing that uses intuitive pattern information instead of complex formulas, and it is capable of stable and fast convergence. Furthermore, because it approves that distortion in retrieving irrelative data is adaptive to avoid storing lots of repetitive external information in daily visualization. Subsequently, this distortion is analyzed via two... 

A new method for speeding up the approximate maximum posterior marginal (MPM) inference in meanfield approximation of a fully connected graph is introduced. Weight of graph edges is measured by mixture of Gaussian kernels. This fully connected graph is used for segmentation of image data. The bottleneck of the inference in meanfield approximation is where the similar bilateral filtering is needed for updating the marginal in the message passing step. To speed up the inference, the adaptive manifold high dimensional Gaussian filter is used. As its time complexity is 0(ND), it leads to accelerating the marginal update in the message passing step. Its time complexity is linear and relative to... 

Recently, data stream has become popular in many contexts of data mining. Due to the high amount of incoming data, traditional clustering algorithms are not suitable for this family of problems. Many data stream clustering algorithms proposed in recent years considered the scalability of data, but most of them did not attend the following issues: (1) The quality of clustering can be dramatically low over the time. (2) Some of the algorithms cannot handle arbitrary shapes of data stream and consequently the results are limited to specific regions. (3) Most of the algorithms have not been evaluated in multi-density environments. Identifying appropriate clusters for data stream by handling the... 

Feature selection is a fundamental problem in machine learning and data mining. The majority of feature selection algorithms are designed for running on a single machine (centralized setting) and they are less applicable to very large datasets. Although there are some distributed methods to tackle this problem, most of them are distributing the data horizontally which are not suitable for datasets with a large number of features and few number of instances. Thus, in this paper, we introduce a novel vertically distributable feature selection method in order to speed up this process and be able to handle very large datasets in a scalable manner. In general, feature selection methods aim at... 

Computational intelligence (CI) as an offshoot of artificial intelligence (AI), is becoming more and more widespread nowadays for solving different engineering problems. Especially by embracing Swarm Intelligence techniques such as ant colony optimization (ACO), CI is known as a good alternative to classical AI for dealing with practical problems which are not easy to solve by traditional methods. Besides, electricity load forecasting is one of the most important concerns of power systems, consequently; developing intelligent methods in order to perform accurate forecasts is vital for such systems. This study presents a hybrid CI methodology (called ACO-GA) by integration of ant colony... 

Data stream classification is one of the most challenging areas in the machine learning. In this paper, we focus on three major challenges namely infinite length, concept-drift and concept-evolution. Infinite length causes the inability to store all instances. Concept-drift is the change in the underlying concept and occurs in almost every data stream. Concept-evolution, in fact, is the arrival of novel classes and is an undeniable phenomenon in most real world data streams. There are lots of researches about data stream classification, but most of them focus on the first two challenges and ignore the last one. In this paper, we propose new method based on ensembles whose classifiers use... 

Nowadays, e-learning platforms are widely used by universities and other research-based and educational institutions. Despite lots of advantages these educational environments provide for organizations, yet there are many unresolved problems which cause instructors and training managers with some difficulties to get proper information about the students' learning behavior. On one hand, lack of tools to measure, assess, and evaluate the performance of learners in educational activities has led the educators to fail to guarantee the success of learning process. On the other hand, strict structure of learning materials prevents students to acquire knowledge based on their learning style.... 

In this paper, we present new adaptive linear discriminant analysis (LDA) algorithm and apply them for adaptive facial feature extraction. Adaptive nature of the proposed algorithm is advantageous for real world applications in which one confronts with a sequence of data such as online face recognition and mobile robotics. Application of the new algorithm on feature extraction from facial image sequences is given in three steps: i) adaptive image preprocessing, ii) adaptive dimension reduction and iii) adaptive LDA feature estimation. Steps 1 and 2 are done simultaneously and outputs of stage 2 are used as a sequence of inputs for stage3. The proposed system was tested on Yale and PIE face...