作者:
Yu, GangGuo, MimiShenzhen Grad Sch
Harbin Inst Technol Sch Mech Engn & Automat Shenzhen Key Lab Digital Mfg Technol Shenzhen Peoples R China
In the process of describing the degradation process of battery of electric vehicle, degradation models under dynamic running conditions need to be analyzed in order to effectively forecast the remaining useful mileag...
详细信息
ISBN:
(纸本)9783037859223
In the process of describing the degradation process of battery of electric vehicle, degradation models under dynamic running conditions need to be analyzed in order to effectively forecast the remaining useful mileage and life of battery. This paper proposed a new method of patternrecognition based on ART2 network to distinguish the degradation mode of the battery of electric vehicle. First, the degradation mechanism is analyzed of the battery to extract the features of degradation process. Then the learning process of ART2 is designed for recognition of the degradation mode. After that, HMM is applied to research the dynamic changes of the degradation mode and predict future degradation mode sequences. Finally, experimental analysis based on battery's charge and discharge data proves the effectiveness of the proposed approach.
Two new approaches to parametrization of specific (flame representative) part of a color space, labeled by an expert, are presented. The first concept is to apply D. Tax39;s one-class classifier as a steerable descr...
详细信息
ISBN:
(纸本)9783319089799;9783319089782
Two new approaches to parametrization of specific (flame representative) part of a color space, labeled by an expert, are presented. The first concept is to apply D. Tax's one-class classifier as a steerable descriptor of such a complex volumetric structure. The second concept is based on approximation of the training data by a set of elliptic cylinders arranged along the principal components. Parameters of such elliptic cylinders describe the training set. The efficiency of the approaches has been proven by experimental study which let allowed us to compare the standard Gaussian Mixture Model based approach with the two proposed in the paper.
In this contribution, we consider learning tasks of a robot simulating a waiter in a restaurant. The robot records experiences and creates or adapts concepts represented in the web ontology language OWL 2, extended by...
详细信息
ISBN:
(纸本)9783319089799;9783319089782
In this contribution, we consider learning tasks of a robot simulating a waiter in a restaurant. The robot records experiences and creates or adapts concepts represented in the web ontology language OWL 2, extended by quantitative spatial and temporal information. As a typical task, the robot is instructed to perform a specific activity in a few concrete scenarios and then expected to autonomously apply the conceptualized experiences to a new scenario. Constructing concepts from examples in a formal knowledge representation framework is well understood in principle, but several aspects important for realistic applications in robotics have remained unattended and are addressed in this paper. First, we consider conceptual representations of activity concepts combined with relevant factual knowledge about the environment. Second, the instructions can be coarse, confined to essential steps of a task, hence the robot has to autonomously determine the relevant context. Third, we propose a "Good Common Subsumer" as opposed to the formal "Least Common Subsumer" for the conceptualization of examples in order to obtain cognitively plausible results. Experiments are based on work in Project RACE(1) where a PR2 robot is employed for recording experiences, learning and applying the learnt concepts.
Associative classification has shown good result over many classification techniques on static datasets. However, little work has been done on associative classification over data streams. Different from data in tradi...
详细信息
ISBN:
(纸本)9783319089799;9783319089782
Associative classification has shown good result over many classification techniques on static datasets. However, little work has been done on associative classification over data streams. Different from data in traditional static databases, data streams typically arrive continuously and unboundedly with occasionally changing data distribution known as concept drift. In this paper, we propose a new Associative Classification over Concept-Drifting data streams, ACCD. ACCD is able to accurately detect concept drift in data streams and reduce its effect by using an ensemble of classifiers. A mechanism for statistical accuracy bounds estimation is used for supporting concept-drift detection. With this mechanism, accuracy recovering time is decreased and a situation where ensemble of classifiers drops accuracy is avoided. Compared to AC-DS (first technique on associative classification algorithm over data streams), AUEH (Accuracy updated ensemble with Hoeffding tree) and VFDT(Very Fast Decision Trees) on 4 real-world data stream datasets, ACCD exhibits the best performance in terms of accuracy.
This paper presents a new dictionary learning method for reconstruction tasks. Based on Empirical Mode Decomposition(EMD) and Hilbert Transformation, the dictionary is learnt, once and for all, from data having a comp...
详细信息
Recent studies have demonstrated that Semi-Supervised learning (SSL) approaches that use both labeled and unlabeled data are more effective and robust than those that use only labeled data. However, it is also well kn...
详细信息
Stream data applications have become more and more prominent recently and the requirements for stream clustering algorithms have increased drastically. Due to continuously evolving nature of the stream, it is crucial ...
详细信息
ISBN:
(纸本)9783319089799;9783319089782
Stream data applications have become more and more prominent recently and the requirements for stream clustering algorithms have increased drastically. Due to continuously evolving nature of the stream, it is crucial that the algorithm autonomously detects clusters of arbitrary shape, with different densities, and varying number of clusters. Although available density-based stream clustering are able to detect clusters with arbitrary shapes and varying numbers, they fail to adapt their thresholds to detect clusters with different densities. In this paper we propose a stream clustering algorithm called HASTREAM, which is based on a hierarchical density-based clustering model that automatically detects clusters of different densities. The density thresholds are independently adapted to the existing data without the need of any user intervention. To reduce the high computational cost of the presented approach, techniques from the graph theory domain are utilized to devise an incremental update of the underlying model. To show the effectiveness of HASTREAM and hierarchical density-based approaches in general, several synthetic and real world data sets are evaluated using various quality measures. The results showed that the hierarchical property of the model was able to improve the quality of density-based stream clusterings and enabled HASTREAM to detect streaming clusters of different densities.
Tool fault analysis is a common task for process engineers in modern industries to maintain high yields of the final products. Statistical process control is a monitoring method normally adopted by most engineers. Rec...
详细信息
With dozens of popular programming languages used worldwide, the number of source code files of programs available online for public use is massive. However most blogs, forums or online Q& A websites have poor sea...
详细信息
ISBN:
(纸本)9783319089799;9783319089782
With dozens of popular programming languages used worldwide, the number of source code files of programs available online for public use is massive. However most blogs, forums or online Q& A websites have poor searchability for specific programming language source code. Naive thumb rules based on the file extension if any are invariably used for syntax highlighting, indentation and other ways to improve readability of the code by programming language editors. A more systematic way to identify the language in which a given source file was written would be of immense value. We believe that simple Bayesiam models would be adequate for this given the intrinsic syntactic structure of any programming language. In this paper, we present Bayesian learning models for correctly identifying the programming language in which a given piece of source code was written, with high probability. We have used 20000 source code files across 10 programming languages to train and test the model using the following Bayesian classifier models - Naive Bayes, Bayesian Network and Multinomial Naive Bayes. Lastly, we show a performance comparison among the three models in terms of classification accuracy on the test data.
The objective of link prediction for social network is to estimate the likelihood that a link exists between two nodes x and y. There are some well-known local information-based link prediction algorithms (LILPAs) whi...
详细信息
暂无评论