In this paper we propose a novel data clustering algorithm based on the idea of considering the individual data items as cells belonging to an uni-dimensional cellular automaton. Our proposed algorithm combines insigh...
详细信息
ISBN:
(纸本)9783642213441
In this paper we propose a novel data clustering algorithm based on the idea of considering the individual data items as cells belonging to an uni-dimensional cellular automaton. Our proposed algorithm combines insights from both social segregation models based on Cellular Automata theory, where the data items themselves are able to move autonomously in lattices, and also from Ants Clustering algorithms, particularly in the idea of distributing at random the data items to be clustered in lattices. We present a series of experiments with both synthetic and real datasets in order to study empirically the convergence and performance results. these experimental results are compared to the obtained by conventional clustering algorithms.
We propose an algorithm for multi-relational patternminingthrough the problem established in WARMR. In order to overcome the combinatorial problem of large pattern space, another algorithm MAPIX restricts patterns i...
详细信息
ISBN:
(纸本)9783642212949;9783642212956
We propose an algorithm for multi-relational patternminingthrough the problem established in WARMR. In order to overcome the combinatorial problem of large pattern space, another algorithm MAPIX restricts patterns into combination of basic patterns, called properties. A property is defined as a set of literals appeared in examples and is of an extended attribute-value form. Advantage of MAPIX is to make patterns from pattern fragments occurred in examples. Many patterns which are not appeared in examples are not tested. Although the range of patterns is clear and MAPIX enumerates them efficiently, a large part of patterns are out of the range. the proposing algorithm keeps the advantage and extends the way of combination of properties. the algorithm combines properties as they appeared in examples, we call it structure preserving combination.
the proceedings contain 15 papers. the topics discussed include: estimating probability of failure of a complex system based on partial information about subsystems and components, with potential applications to aircr...
the proceedings contain 15 papers. the topics discussed include: estimating probability of failure of a complex system based on partial information about subsystems and components, with potential applications to aircraft maintenance;stepwise feature selection using multiple kernel learning;empirical reconstruction of fuzzy model of experiment in the Euclidean metric;SVM based offline handwritten gurmukhi character recognition;obtaining of a minimal polygonal representation of a curve by means of a fuzzy clustering;KDDClus: a simple method for multi-density clustering;intelligent datamining for turbo-generator predictive maintenance: an approach in real-world;handwritten script identification from a bi-script document at line level using gabor filters;image recognition using kullback-leibler information discrimination;beyond analytical modeling, gathering data to predict real agents' strategic interaction;and construction of enzyme network of arabidopsis thaliana using graph theory.
Winner-Take-All (WTA) and its extended version K-Winner-Take-All (KWTA) networks have been frequently used as the classifiers in neural networks. they are very important tools in datamining, machinelearning and Patt...
详细信息
the problem of job stress is generally recognized as one of the major factors leading to a spectrum of health problems. People with certain professions, like intensive care specialists or call-center operators, and pe...
详细信息
Nowadays we are faced with fast growing and permanently evolving data, including social networks and sensor data recorded from smart phones or vehicles. Temporally evolving data brings a lot of new challenges to the d...
详细信息
ISBN:
(纸本)9781450308328
Nowadays we are faced with fast growing and permanently evolving data, including social networks and sensor data recorded from smart phones or vehicles. Temporally evolving data brings a lot of new challenges to the datamining and machinelearning community. this paper is concerned withthe recognition of recurring patterns within multivariate time series, which capture the evolution of multiple parameters over a certain period of time. Our approach first separates a time series into segments that can be considered as situations, and then clusters the recognized segments into groups of similar context. the time series segmentation is established in a bottom-up manner according the correlation of the individual signals. Recognized segments are grouped in terms of statistical features using agglomerative hierarchical clustering. the proposed approach is evaluated on the basis of real life sensor data from different vehicles recorded during car drives. According to our evaluation it is feasible to recognize recurring patterns in time series by means of bottom-up segmentation and hierarchical clustering. Copyright 2011 ACM.
One of the essential but formidable tasks in cloud computing is to detect malicious attacks and their types. A cloud provider's constraints or inability in monitoring its employees, and lack of transparency, may m...
详细信息
ISBN:
(纸本)9780769546001
One of the essential but formidable tasks in cloud computing is to detect malicious attacks and their types. A cloud provider's constraints or inability in monitoring its employees, and lack of transparency, may make the detection process even harder. We found these insiders' activities form similar pattern in the monitoring systems as some other cyber attacks because these also uses huge computer resources. In this paper we first provide a brief overview on the importance of monitoring insiders' activities through a literature survey on cloud computing security. then, we observe some of the real life insiders' activities that can be detected from the performance data in a hypervisor and its guest operating systems. Rule based learning is successfully used for identification of these activities in this research. We further observe that some of these insiders' activities can on occasions turn into a malicious insider's attack, and thus, need constant monitoring in the cloud environment.
Incremental learning has recently received broad attention in many applications of patternrecognition and datamining. With many typical incremental learning situations in the real world where a fast response to chan...
详细信息
ISBN:
(纸本)9783642202667
Incremental learning has recently received broad attention in many applications of patternrecognition and datamining. With many typical incremental learning situations in the real world where a fast response to changing data is necessary, developing a parallel implementation (in fast processing units) will give great impact to many applications. Current research on incremental learning methods employs a modified version of a resource allocating network (RAN) which is one variation of a radial basis function network (RBFN). this paper evaluates the impact of a Graphics Processing Units (GPU) based implementation of a RAN network incorporating Long Term Memory (LTM) [4]. the incremental learning algorithm is compared withthe batch RBF approach in terms of accuracy and computational cost, both in sequential and GPU implementations. the UCI machinelearning benchmark datasets and a real world problem of multimedia forgery detection were considered in the experiments. the preliminary evaluation shows that although the creation of the model is faster withthe RBF algorithm, the RAN-LTM can be useful in environments withthe need of fast changing models and high-dimensional data.
Human-machine interaction requires the ability to analyze and discern human faces. Due to the nature of the 3D to 2D projection, the recognition of human faces from 2D images, in presence of pose and illumination vari...
详细信息
ISBN:
(数字)9783642216633
ISBN:
(纸本)9783642216626;9783642216633
Human-machine interaction requires the ability to analyze and discern human faces. Due to the nature of the 3D to 2D projection, the recognition of human faces from 2D images, in presence of pose and illumination variations, is intrinsically an ill-posed problem. the direct measurement of the shape for the face surface is now a feasible solution to overcome this problem and make it well-posed. this paper proposes a completely automatic algorithm for 3D face registration and matching based on the extraction of stable 3D facial features characterizing the face and the subsequent construction of a signature manifold. the facial features are extracted by performing a continuous-to-discrete scale-space analysis. Registration is driven from the matching of triplets of feature points and the registration error is computed as shape matching score. A major advantage of the proposed method is that no data pre-processing is required. Despite of the high dimensionality of the data (sets of 3D points, possibly withthe associate texture), the signature and hence the template generated is very small. therefore, the management of the biometric data associated to the user data, not only is very robust to environmental changes, but it is also very compact. the method has been tested against the Bosphorus 3D face database and the performances compared to the ICP baseline algorithm. Even in presence of noise in the data, the algorithm proved to be very robust and reported identification performances in line withthe current state of the art.
Forensic study of mobile devices is a relatively new field, dating from the early 2000s. the proliferation of phones (particularly smartphones) on the consumer market has caused a growing demand for forensic examinati...
详细信息
ISBN:
(纸本)9780769546001
Forensic study of mobile devices is a relatively new field, dating from the early 2000s. the proliferation of phones (particularly smartphones) on the consumer market has caused a growing demand for forensic examination of the devices, which could not be met by existing Computer Forensics techniques. As a matter of fact, Law enforcement are much more likely to encounter a suspect with a mobile device in his possession than a PC or laptop and so the growth of demand for analysis of mobiles has increased exponentially in the last decade. Early investigations, moreover, consisted of live analysis of mobile devices by examining phone contents directly via the screen and photographing it withthe risk of modifying the device content, as well as leaving many parts of the proprietary operating system inaccessible. the recent development of Mobile Forensics, a branch of Digital Forensics, is the answer to the demand of forensically sound examination procedures of gathering, retrieving, identifying, storing and documenting evidence of any digital device that has both internal memory and communication ability [1]. Over time commercial tools appeared which allowed analysts to recover phone content with minimal interference and examine it separately. By means of such toolkits, moreover, it is now possible to think of a new approach to Mobile Forensics which takes also advantage of "datamining" and "machinelearning" theory. this paper is the result of study concerning cell phones classification in a real case of pedophilia. Based on Mobile Forensics "Triaging" concept and the adoption of self-knowledge algorithms for classifying mobile devices, we focused our attention on a viable way to predict phone usage's classifications. Based on a set of real sized phones, the research has been extensively discussed with Italian law enforcement cybercrime specialists in order to find a viable methodology to determine the likelihood that a mobile phone has been used to commit the specific
暂无评论