As the wireless services developed rapidly in the recent years, a diversity of wireless services emerge such that radio environment becomes more and more complicated. Radio Spectrum security is now attached with great...
详细信息
As the wireless services developed rapidly in the recent years, a diversity of wireless services emerge such that radio environment becomes more and more complicated. Radio Spectrum security is now attached with great importance. Real time spectrum anomalies detection is vital for increasing demand on security to ensure that wireless services function on the rails. Malicious radio events, such as illegal channel occupation, happened frequently in the recent years, which result in severe interference to the normal radio spectrum usage. there were anomalies detection approaches in different areas proposed to conquer such malicious events. However, those malicious events usually happen in a short interval, this increases the demand on instantaneous responds for real-time events, and the complexity of previous approaches makes them insufficient to handle the real time task. In this paper, a new approach for anomalies detection in spectrum monitoring is proposed. Distinct from previous anomalies detection methods, both temporal and spectral information are taken into account and utilized to find out the potential anomalies. Meanwhile, an adaptive learning ability is proposed along to respond to the real-time change of radio environment. To analyze spectrum measurement data with high dimension, Mahalanobis distance is applied to disclose potential anomalies according to the historical pattern of radio spectrum. Methodology analysis and real case study have been performed to validate the detection effectiveness in practice.
mining bilingual data (including bilingual sentences and terms) from the Web can benefit many NLP applications, such as machine translation and cross language information retrieval. In this paper, based on the observa...
ISBN:
(纸本)9781932432466
mining bilingual data (including bilingual sentences and terms) from the Web can benefit many NLP applications, such as machine translation and cross language information retrieval. In this paper, based on the observation that bilingual data in many web pages appear collectively following similar patterns, an adaptive pattern-based bilingual datamining method is proposed. Specifically, given a web page, the method contains four steps: 1) preprocessing: parse the web page into a DOM tree and segment the inner text of each node into snippets; 2) seed mining: identify potential translation pairs (seeds) using a word based alignment model which takes both translation and transliteration into consideration; 3) patternlearning: learn generalized patterns withthe identified seeds; 4) pattern based mining: extract all bilingual data in the page using the learned patterns. Our experiments on Chinese web pages produced more than 7.5 million pairs of bilingual sentences and more than 5 million pairs of bilingual terms, both with over 80% accuracy.
Manifold learning has currently become a hot issue in the field of machinelearning, patternrecognition and datamining. Locally linear embedding (LLE) is one of several promising manifold learning methods. But ordin...
详细信息
ISBN:
(纸本)9780769533056
Manifold learning has currently become a hot issue in the field of machinelearning, patternrecognition and datamining. Locally linear embedding (LLE) is one of several promising manifold learning methods. But ordinary LLE can not distinguish effectively the low-dimensional embeddings of noise data. By introducing the reconstruction similarity into LLE, this paper proposes a generalized locally linear embedding algorithm based on local reconstruction similarity. Experimental results show on Columbia object image datathat the new generalized version is superior to LLE in revealing the visualization of high-dimensional image dataset containing noise images.
Recently, the class imbalance problem has attracted much attention from researchers in the field of datamining. When learning from imbalanced data in which most examples are labeled as one class and only few belong t...
详细信息
Recently, the class imbalance problem has attracted much attention from researchers in the field of datamining. When learning from imbalanced data in which most examples are labeled as one class and only few belong to another class, traditional datamining approaches do not have a good ability to predict the crucial minority instances. Unfortunately, many real world data sets like health examination, inspection, credit fraud detection, spam identification and text mining all are faced withthis situation. In this study, we present a novel model called the "Information Granulation Based datamining Approach" to tackle this problem. the proposed methodology, which imitates the human ability to process information, acquires knowledge from Information Granules rather then from numerical data. this method also introduces a Latent Semantic Indexing based feature extraction tool by using Singular Value Decomposition, to dramatically reduce the data dimensions. In addition, several data sets from the UCI machinelearning Repository are employed to demonstrate the effectiveness of our method. Experimental results show that our method can significantly increase the ability of classifying imbalanced data. (c) 2008 Elsevier Inc. All rights reserved.
Dimensionality reduction has long been an active research topic within statistics, patternrecognition, machinelearning and datamining. It can improve the efficiency and the effectiveness of datamining by reducing ...
详细信息
ISBN:
(纸本)9780769533056
Dimensionality reduction has long been an active research topic within statistics, patternrecognition, machinelearning and datamining. It can improve the efficiency and the effectiveness of datamining by reducing the dimensions of feature space and removing the irrelevant and redundant information. In this paper we transform the attribute selection problem into the optimization problem which tries to find the attribute subset withthe maximal fractal dimension and the attribute number restriction simultaneously. In order to avoid exhaustive search in the huge attribute subset space we integrate the individual attribute priority with attribute subset evaluation for dimensionality reduction and propose the unsupervised Sequential Forward Fractal Dimensionality Reduction(SFFDR) algorithm. Our experiments on synthetic and real datasets show that the algorithm proposed can get the satisfied resulting attribute subset with a rather low time complexity.
the control and monitoring of drinking water is becoming more and more interesting because of its effects on human life. Many techniques were developed in this field in order to ameliorate this process control attendi...
详细信息
ISBN:
(纸本)9781424422050
the control and monitoring of drinking water is becoming more and more interesting because of its effects on human life. Many techniques were developed in this field in order to ameliorate this process control attending to rigorous follow-ups of the quality of this vital resource. Several methods were implemented to achieve this goal. In this paper, a comparative study of two techniques resulting from the field of the artificial intelligence namely: RBF Neural Network (RBF-NN) and Support Vector machine (SVM), is presented Developed from the statistical learningtheory, these methods display optimal training performances and generalization in many fields of application, among others the field of patternrecognition. Applied as classification tools, these techniques should ensure within a multi-sensor monitoring system, a direct and quasi permanent control of water quality. In order to evaluate their performances, a simulation using real data, corresponding to the recognition rate, the training time, and the robustness, is carried out. To validate their functionalities, an application is presented.
the availability of relevance feedback is held back by the problem of the imbalance and limited size of labeled training data, as well as the real-time requirement of online interaction demands. In this paper, we prop...
详细信息
ISBN:
(纸本)9780889867178
the availability of relevance feedback is held back by the problem of the imbalance and limited size of labeled training data, as well as the real-time requirement of online interaction demands. In this paper, we propose a relevance feedback algorithm called active biased SVM (BSVM) learning, in which biased classification and active learning are employed to address these difficulties. the algorithm is applied to content-based sketch retrieval (CBSR), and the experiments prove boththe effectiveness and efficiency of the proposed approach.
the proceedings contain 111 papers. the topics discussed include: evolutionary multiobjective optimization and multiobjective fuzzy system design;chance discovery as value sensing by data based meta cognition;building...
ISBN:
(纸本)9781605580463
the proceedings contain 111 papers. the topics discussed include: evolutionary multiobjective optimization and multiobjective fuzzy system design;chance discovery as value sensing by data based meta cognition;building classification rules for case based classifier using fuzzy sets and formal concept analysis;intelligent hybrid system for patternrecognition and classification;hybrid approach using ant colony optimization and fuzzy logic to solve multi-criteria hybrid flow shop scheduling problem;improving performance of intrusion detection system by applying a new machinelearning strategy;network security simulation and evaluation;extending web applications with a lightweight zero knowledge proof authentication;implementation of a neural-based navigation approach on indoor and outdoor mobile robots;a human-machine interface design for direct rehabilitation using a rehabilitation robot;and Persian on-line handwritten character recognition by RCE spatio-temporal neural network.
mining Top-Rank-K frequent patterns is a new topic in frequent patternmining. In this paper, we propose a new mining algorithm called VTK, Vertical mining of Top-Rank-K Frequent patterns, to mining Top-Rank-K frequen...
详细信息
ISBN:
(纸本)9780769533056
mining Top-Rank-K frequent patterns is a new topic in frequent patternmining. In this paper, we propose a new mining algorithm called VTK, Vertical mining of Top-Rank-K Frequent patterns, to mining Top-Rank-K frequent patterns using some Vertical skills. Our performance study shows that the VTK method is more efficient and scalable for mining both synthetic datasets and real datasets than the algorithms proposed before.
Feature selection is an important task in machinelearning, patternrecognition and datamining. this paper proposed a new feature selection method for classification, named SD, which is based on scatter matrix used i...
详细信息
ISBN:
(纸本)9781424420957
Feature selection is an important task in machinelearning, patternrecognition and datamining. this paper proposed a new feature selection method for classification, named SD, which is based on scatter matrix used in linear discriminant analysis. the main feature of SD is its simplicity and independency of learning algorithms. High-dimensional data samples are first projected into a lower dimensional subspace of the original feature space by means of a linear transformation matrix, which can be attained according to the scatter degree of each feature, and then the scatter degree is used to measure the importance of each feature. A comparison of SD and some popular feature selection methods (information gain and X-2-test) is conducted, and the results of experiment carried out on 19 data sets show the advantages of SD.
暂无评论