PAC Learning of One-Dimensional Patterns

Developing the ability to recognize a landmark from a visual image of a robot's current location is a fundamental problem in robotics. We consider the problem of PAC-learning the concept class of geometric patterns where the target geometric pattern is a configuration ofk points on the real line. Each instance is a configuration ofn points on the real line, where it is labeled according to whether or not it visually resembles the target pattern. To capture the notion of visual resemblance we use the Hausdorff metric. Informally, two geometric patternsP andQ resemble each other under the Hausdorff metric if every point on one pattern is close to some point on the other pattern. We relate the concept class of geometric patterns to the landmark matching problem and then present a polynomial-time algorithm that PAC-learns the class of one-dimensional geometric patterns. We also present some experimental results on how our algorithm performs.     

A pairing-free identity-based authenticated key agreement protocol with minimal message exchanges

Based on the computational Diffie-Hellman problem, this paper proposes an identity-based authenticated key agreement protocol which removes bilinear pairings. Compared with previous protocols, the new protocol minimizes message exchange time with no extra cost. The protocol provides strong security guarantees including key compromise impersonation resilience, perfect forward secrecy, and master key forward secrecy. A security proof with the modular approach in the modified Bellare-Rogaway model is also provided.     

Hybrid microdata using microaggregation

Statistical disclosure control (also known as privacy-preserving data mining) of microdata is about releasing data sets containing the answers of individual respondents protected in such a way that: (i) the respondents corresponding to the released records cannot be re-identified; (ii) the released data stay analytically useful. Usually, the protected data set is generated by either masking (i.e. perturbing) the original data or by generating synthetic (i.e. simulated) data preserving some pre-selected statistics of the original data. Masked data may approximately preserve a broad range of distributional characteristics, although very few of them (if any) are exactly preserved; on the other hand, synthetic data exactly preserve the pre-selected statistics and may seem less disclosive than masked data, but they do not preserve at all any statistics other than those pre-selected. Hybrid data obtained by mixing the original data and synthetic data have been proposed in the literature to combine the strengths of masked and synthetic data. We show how to easily obtain hybrid data by combining microaggregation with any synthetic data generator. We show that numerical hybrid data exactly preserving means and covariances of original data and approximately preserving other statistics as well as some subdomain analyses can be obtained as a particular case with a very simple parameterization. The new method is competitive versus both the literature on hybrid data and plain multivariate microaggregation.     

Adaptive PSODV algorithm for OPF with non-smooth cost functions and statistical analysis

This paper presents a particle swarm optimization with differentially perturbed velocity hybrid algorithm with adaptive acceleration coefficient (APSO-DV) for solving the optimal power flow problem with non-smooth and non-convex generator fuel cost characteristics. The APSO-DV employs differentially perturbed velocity with adaptive acceleration coefficient for updating the positions of particles for the particle swarm optimization. The feasibility of the proposed approach was tested on IEEE 30-bus and IEEE 118-bus systems with three different objective functions. Several cases were investigated to test and validate the robustness of the proposed method in finding the optimal solution. The effectiveness of the proposed approach was tested including contingency also. Simulation results demonstrate that the APSO-DV provides superior results compared to classical DE, PSO, PSO-DV and other methods recently reported in the literature. An innovative statistical analysis based on central tendency measures and dispersion measures was carried out on the bus voltage profiles and voltage stability indices.     

A finite element alternative to infinite elements

In this paper, a simple idea based on midpoint integration rule is utilized to solve a particular class of mechanics problems; namely static problems defined on unbounded domains where the solution is required to be accurate only in an interior (and not in the far field). By developing a finite element mesh that approximates the stiffness of an unbounded domain directly (without approximating the far-field displacement profile first), the current formulation provides a superior alternative to infinite elements (IEs) that have long been used to incorporate unbounded domains into the finite element method (FEM). In contrast to most IEs, the present formulation (a) requires no new shape functions or special integration rules, (b) is proved to be both accurate and efficient, and (c) is versatile enough to handle a large variety of domains including those with anisotropic, stratified media and convex polygonal corners. In addition to this, the proposed model leads to the derivation of a simple error expression that provides an explicit correlation between the mesh parameters and the accuracy achieved. This error expression can be used to calculate the accuracy of a given mesh a-priori. This in-turn, allows one to generate the most efficient mesh capable of achieving a desired accuracy by solving a mesh optimization problem. We formulate such an optimization problem, solve it and use the results to develop a practical mesh generation methodology. This methodology does not require any additional computation on the part of the user, and can hence be used in practical situations to quickly generate an efficient and near optimal finite element mesh that models an unbounded domain to the required accuracy. Numerical examples involving practical problems are presented at the end to illustrate the effectiveness of this method.     

一种不平衡数据渐进学习算法

针对不平衡数据学习问题,提出一种采用渐进学习方式的分类算法。根据属性值域分布,逐步添加合成少数类样例,并在阶段分类器出现误分时,及时删除被误分的合成样例。当数据达到预期的平衡程度时,用原始数据和合成数据训练学习算法,得到最终分类器。实验结果表明,该算法优于C4.5算法,并在多数数据集上优于SMOTEBoost和DataBoost-IM。     

O3R: Ontology-based mechanism for a human-centered environment targeted at the analysis of navigation patterns

Web Usage Mining (WUM) is the application of data mining techniques over Web server logs in order to extract navigation usage patterns. The analysis of mining patterns for assessing the knowledge they reveal is a critical phase in WUM. The main challenges are: (a) mining algorithms yield a huge number of patterns and (b) there is a significant semantic gap between URLs and events performed by users. In this paper, we describe the pattern analysis mechanisms integrated in O3R (Ontology-based Rules Retrieval and Rummaging), a human-centered environment for the analysis of navigation rules. O3R explores the synergy of mechanisms for retrieving and analyzing patterns. Filtering and clustering allow users to retrieve subsets of patterns with specific characteristics, in order to deal with the large volume of patterns. Rummaging mechanisms are targeted at assessing the meaning and relevance of pattern with regard to the domain, and it is particularly suitable for exploratory analysis. The distinctive feature of O3R is that is dynamically associates meaning to patterns using the concepts and relationships of a domain ontology, as a means of reducing the gap between syntactic URLs and semantic events performed by users. The paper describes the mechanisms in detail, and explores their synergic integration in the O3R prototype. It also reports two case studies that evaluate the use of O3R for the analysis of navigation patterns of a learning site.     

A fuzzy ensemble of parallel polynomial neural networks with information granules formed by fuzzy clustering

In this paper, we introduce a new category of fuzzy models called a fuzzy ensemble of parallel polynomial neural network (FEP²N²), which consist of a series of polynomial neural networks weighted by activation levels of information granules formed with the use of fuzzy clustering. The two underlying design mechanisms of the proposed networks rely on information granules resulting from the use of fuzzy C-means clustering (FCM) and take advantage of polynomial neural networks (PNNs).The resulting model comes in the form of parallel polynomial neural networks. In the design procedure, in order to estimate the optimal values of the coefficients of polynomial neural networks we use a weighted least square estimation algorithm. We incorporate various types of structures as the consequent part of the fuzzy model when using the learning algorithm. Among the diverse structures being available, we consider polynomial neural networks, which exhibit highly nonlinear characteristics when being viewed as local learning models.We use FCM to form information granules and to overcome the high dimensionality problem. We adopt PNNs to find the optimal local models, which can describe the relationship between the input variables and output variable within some local region of the input space.We show that the generalization capabilities as well as the approximation abilities of the proposed model are improved as a result of using polynomial neural networks. The performance of the network is quantified through experimentation in which we use a number of benchmarks already exploited within the realm of fuzzy or neurofuzzy modeling.     

Handling multi-objective optimization problems with a multi-swarm cooperative particle swarm optimizer

This paper presents a new multi-objective optimization algorithm in which multi-swarm cooperative strategy is incorporated into particle swarm optimization algorithm, called multi-swarm cooperative multi-objective particle swarm optimizer (MC-MOPSO). This algorithm consists of multiple slave swarms and one master swarm. Each slave swarm is designed to optimize one objective function of the multi-objective problem in order to find out all the non-dominated optima of this objective function. In order to produce a well distributed Pareto front, the master swarm is developed to cover gaps among non-dominated optima by using a local MOPSO algorithm. Moreover, in order to strengthen the capability locating multiple optima of the PSO, several improved techniques such as the Pareto dominance-based species technique and the escape strategy of mature species are introduced. The simulation results indicate that our algorithm is highly competitive to solving the multi-objective optimization problems.