Privacy preserving data mining is an art of knowledge discovery without revealing the sensitive data of the data set. In this paper a data transformation technique using wavelets is presented for privacy preserving da...
详细信息
the idealconference has become a unique, established and broad interdisciplinary forum for experts, researchers and practitioners in many fields to interact with each other and with leading academics and industries i...
详细信息
ISBN:
(数字)9783642153815
ISBN:
(纸本)9783642153808
the idealconference has become a unique, established and broad interdisciplinary forum for experts, researchers and practitioners in many fields to interact with each other and with leading academics and industries in the areas of machine learning, information processing, data mining, knowledge management, bio-informatics, neu- informatics, bio-inspired models, agents and distributed systems, and hybrid systems. this volume contains the papers presented at the 11th international conference on intelligent data engineering and automated learning (ideal2010), which was held September 1–3, 2010 in the University of the West of Scotland, on its Paisley campus, 15 kilometres from the city of Glasgow, Scotland. All submissions were strictly pe- reviewed by the Programme Committee and only the papers judged with sufficient quality and novelty were accepted and included in the proceedings. the idealconferences continue to evolve and this year’s conference was no exc- tion. the conference papers cover a wide variety of topics which can be classified by technique, aim or application. the techniques include evolutionary algorithms, artificial neural networks, association rules, probabilistic modelling, agent modelling, particle swarm optimization and kernel methods. the aims include regression, classification, clustering and generic data mining. the applications include biological information processing, text processing, physical systems control, video analysis and time series analysis.
In this paper, we sophisticated our agent model and simulated multi-agent society. Agent is designed to compress its data by the eigenvector of its data. Additionally, in order to examine the relation between images o...
详细信息
In this paper, we sophisticated our agent model and simulated multi-agent society. Agent is designed to compress its data by the eigenvector of its data. Additionally, in order to examine the relation between images of groups and communication network, agents' societies are investigated with several parameters. thus, this method is also designed for humanlike decisions in the learning process. the simulation results indicate our real societies, such as classes, companies and so on.
Many of our activities on computer need a verification step for authorized access. the goal of verification is to tell apart the true account owner from intruders. We propose a general approach for user verification b...
详细信息
ISBN:
(纸本)9783642153808
Many of our activities on computer need a verification step for authorized access. the goal of verification is to tell apart the true account owner from intruders. We propose a general approach for user verification based on user trajectory inputs. the approach is labor-free for users and is likely to avoid the possible copy or simulation from other non-authorized users or even automatic programs like bots. Our study focuses on finding the hidden patterns embedded in the trajectories produced by account users. We employ a Markov chain model with Gaussian distribution in its transitions to describe the behavior in the trajectory. To distinguish between two trajectories, we propose a novel dissimilarity measure combined with a manifold learnt tuning for catching the pairwise relationship. Based on the pairwise relationship, we plug-in any effective classification or clustering methods for the detection of unauthorized access. the method can also be applied for the task of recognition, predicting the trajectory type without pre-defined identity. Given a trajectory input, the results show that the proposed method can accurately verify the user identity, or suggest whom owns the trajectory if the input identity is not provided.
the rapid advancement of Artificial Intelligence (AI) technologies is transforming education, particularly in Electrical and Electronic engineering (EEE). this paper explores the potential applications, benefits, and ...
详细信息
Support Vector Machines (SVMs) deliver state-ofthe- art performance in many real-world applications such as text categorization, hand-written character recognition, image classification, biosequences analysis, etc. SV...
详细信息
Support Vector Machines (SVMs) deliver state-ofthe- art performance in many real-world applications such as text categorization, hand-written character recognition, image classification, biosequences analysis, etc. SVMs are one of the standard tools for machine learning and data mining. the classification performances of our proposed fuzzy c-means based classifier (FCMC) on relatively small-sized data sets have been reported. this paper reports the experimental results on large-sized data *** compare FCMC with LibSVM by Chang and Lin, which is one of the superb approaches to the SVM classifier for large-sized data sets.
Cooking typically involves a plethora of decisions about ingredients and tools that need to be chosen in order to write a good cooking recipe. Cooking can be modelled in an optimization framework, as it involves a sea...
详细信息
ISBN:
(纸本)9783030034931;9783030034924
Cooking typically involves a plethora of decisions about ingredients and tools that need to be chosen in order to write a good cooking recipe. Cooking can be modelled in an optimization framework, as it involves a search space of ingredients, kitchen tools, cooking times or temperatures. If we model as an objective function the quality of the recipe, several problems arise. No analytical expression can model all the recipes, so no gradients are available. the objective function is subjective, in other words, it contains noise. Moreover, evaluations are expensive both in time and human resources. Bayesian Optimization (BO) emerges as an ideal methodology to tackle problems withthese characteristics. In this paper, we propose a methodology to suggest recipe recommendations based on a Machine learning (ML) model that fits real and simulated data and BO. We provide empirical evidence with two experiments that support the adequacy of the methodology.
learning from imbalanced multilabel data is a challenging task that has attracted considerable attention lately. Some resampling algorithms used in traditional classification, such as random undersampling and random o...
详细信息
ISBN:
(纸本)9783319108407;9783319108391
learning from imbalanced multilabel data is a challenging task that has attracted considerable attention lately. Some resampling algorithms used in traditional classification, such as random undersampling and random oversampling, have been already adapted in order to work with multilabel datasets. In this paper MLeNN (MultiLabel edited Nearest Neighbor), a heuristic multilabel undersampling algorithm based on the well-known Wilson's Edited Nearest Neighbor Rule, is proposed. the samples to be removed are heuristically selected, instead of randomly picked. the ability of MLeNN to improve classification results is experimentally tested, and its performance against multilabel random undersampling is analyzed. As will be shown, MLeNN is a competitive multilabel undersampling alternative, able to enhance significantly classification results.
the path planning problem of mobile robots is a NP-Hard problem often solved by evolutionary approaches such as Genetic Algorithm (GA) and Ant Colony Optimization (ACO). However, the algorithm's performance is oft...
详细信息
ISBN:
(纸本)9783642412783;9783642412776
the path planning problem of mobile robots is a NP-Hard problem often solved by evolutionary approaches such as Genetic Algorithm (GA) and Ant Colony Optimization (ACO). However, the algorithm's performance is often influenced heavily by the determination of the operators and the choice of related parameters. In this paper, a permutation code PBIL is proposed to solve the path planning problem. First, a free space model of the mobile robot is constructed by the MAKLINK graph;second, a sub-optimal path is generated by the Dijkstra algorithm;then global optimal path is constructed by the permutation code PBIL based on the sub-optimal path. Simulation results show that the PBIL can get satisfied solutions more simply and efficiently with fewer operators and parameters.
SVM-based active learning has been successfully applied when a large number of unlabeled samples are available but getting their labels is costly. However, the kernel used in SVM should be fixed properly before the ac...
详细信息
ISBN:
(纸本)9783540772255
SVM-based active learning has been successfully applied when a large number of unlabeled samples are available but getting their labels is costly. However, the kernel used in SVM should be fixed properly before the active learning process. If the pre-selected kernel is inadequate for the target data, the learned SVM has poor performance. So, new active learning methods are required which effectively find an adequate kernel for the target data as well as the labels of unknown samples. In this paper, we propose a two-phased SKM-based active learning method and a sampling strategy for the purpose. By experiments, we show that the proposed SKM-based active learning method has quick response suited to interaction with human experts and can find an appropriate kernel among linear combinations of given multiple kernels. We also show that withthe proposed sampling strategy, it converges earlier to the proper combination of kernels than withthe popular sampling strategy MARGIN.
暂无评论