Ensemble echo network with deep architecture for time-series modeling

Neural Computing and Applications - Echo state network belongs to a kind of recurrent neural networks that have been extensively employed to model time-series datasets. The function of reservoir in...     

J-LDFR: joint low-level and deep neural network feature representations for pedestrian gender classification

Neural Computing and Applications - Appearance-based gender classification is one of the key areas in pedestrian analysis, and it has many useful applications such as visual surveillance, predict...     

Visualising hierarchical associations

Recent association-mining research has led to the development of techniques that allow the accommodation of concept hierarchies within the mining process. This extension results in the discovery of rules which associate not only groups of items but which are also influenced by the hierarchies within which an item may reside. Given this, there then arises a need for techniques whereby such hierarchical associations can be presented to the user. Current association rule visualisation techniques are limited, as they do not effectively incorporate or enable the visualisation of hierarchical semantics. This paper presents a review of current hierarchical and association visualisation techniques and introduces a novel technique for visualising hierarchical association rules.     

Long-term time-series pollution forecast using statistical and deep learning methods

Neural Computing and Applications - Tackling air pollution has become of utmost importance since the last few decades. Different statistical as well as deep learning methods have been proposed till...     

Learning social representations with deep autoencoder for recommender system

World Wide Web - With the development of online social media, it attracts increasingly attentions to utilize social information for recommender systems. Based on the intuition that users are...     

Enhancing attributed network embedding via enriched attribute representations

Applied Intelligence - Attributed network embedding enables to generate low-dimensional representations of network objects by leveraging both network structure and attribute data. However, how to...     

Artificial neural network representations for hierarchical preference structures

In this paper, we introduce two artificial neural network formulations that can be used to assess the preference ratings from the pairwise comparison matrices of the Analytic Hierarchy Process. First, we introduce a modified Hopfield network that can determine the vector of preference ratings associated with a positive reciprocal comparison matrix. The dynamics of this network are mathematically equivalent to the power method, a widely used numerical method for computing the principal eigenvectors of square matrices. However, this Hopfield network representation is incapable of generalizing the preference patterns, and consequently is not suitable for approximating the preference ratings if the pairwise comparison judgments are imprecise. Second, we present a feed-forward neural network formulation that does have the ability to accurately approximate the preference ratings. We use a simulation experiment to verify the robustness of the feed-forward neural network formulation with respect to imprecise pairwise judgments. From the results of this experiment, we conclude that the feed-forward neural network formulation appears to be a powerful tool for analyzing discrete alternative multicriteria decision problems with imprecise or fuzzy ratio-scale preference judgments.     

Fuzzy neural network with general parameter adaptation for modelingof nonlinear time-series

By taking advantage of fuzzy systems and neural networks, a fuzzy-neural network with a general parameter (GP) learning algorithm and heuristic model structure determination is proposed in this paper. Our network model is based on the Gaussian radial basis function network (RBFN). We use the flexible GP approach both for initializing the off-line training algorithm and fine-tuning the nonlinear model efficiently in online operation. A modification of the robust unbiasedness criterion using distorter (UCD) is utilized for selecting the structural parameters of this adaptive model. The UCD approach provides the desired modeling accuracy and avoids the risk of over-fitting. In order to illustrate the operation of the proposed modeling scheme, it is experimentally applied to a fault detection application.     

Learning multi-level and multi-scale deep representations for privacy image classification

Multimedia Tools and Applications - Privacy image classification can help people detect privacy images when people share images. In this paper, we propose a novel method using multi-level and...     

A local linear radial basis function neural network for financial time-series forecasting

In this paper a Local Linear Radial Basis Function Neural Network (LLRBFN) is presented. The difference between the proposed neural network and the conventional Radial Basis Function Neural Network (RBFN) is connection weights between the hidden layer and the output layer which are replaced by a local linear model in the LLRBFN. A modified Particle Swarm Optimization (PSO) with hunter particles is introduced for training the LLRBFN. The proposed methods have been applied for prediction of financial time-series and the result shows the feasibility and effectiveness.     

Identification of time-series signals using a dynamic neural network with GA-based training

We propose a dynamic neural network (DNN) that realizes a dynamic property and has a network structure with the properties of inertia, viscosity, and stiffness without time-delayed input elements, and a training algorithm based on a genetic algorithm (GA). In a previous study, we proposed a modified training algorithm for the DNN based on the error back-propagation method. However, in the previous method it was necessary to determine the values of the DNN property parameters by trial and error. In the newly proposed DNN, the GA is designed to train not only the connecting weights but also the property parameters of the DNN. Simulation results show that the DNN trained by the GA obtains good performance for time-series patterns generated from an unknown system, and provides a higher performance than the conventional neural network. This work was presented in part at the 10th International Symposium on Artificial Life and Robotics, 0ita, Japan, February 4–6, 2005     

再现3D对象

多亏有了Google上的一种免费工具,3D建模变得不再是一个痛苦而笨拙的过程。Jerome Turner介绍SketchUp的主要功能。     

动态深度信念网络模型构建

深度学习是一类新兴的多层神经网络学习算法,因其缓解了传统训练算法的局部最小性,故引起机器学习领域的广泛关注。但是,如何使一个网络模型在选取任意数值的隐藏层节点数时都能够得到一个比较合适的网络结构是目前深度学习界普遍存在的一个开放性问题。文章提出了一种能够动态地学习模型结构的算法——最大判别能力转换法,根据Fisher准则来评估隐藏层每一个节点的判别性能,然后通过动态地选择部分隐层节点来构建最优的模型结构。     

基于深度置信网络的Android恶意软件检测

针对采用重打包和代码混淆技术的Android恶意软件检测准确率低的问题,提出了一种基于深度置信网络的Android恶意软件检测算法。通过自动化提取Android应用软件的特征,构建对应的特征向量,训练基于深度置信网络的深度学习模型,实现了一种新的基于深度置信网络的Android恶意软件检测算法。实验结果表明,基于深度置信网络的深度学习模型可以更好地表征Android恶意软件,其检测效果也明显优于传统的机器学习模型。     

Neural network based auto association and time-series prediction for biosignal processing in brain-computer interfaces

Neural networks (NNs) can be deployed in many different ways in signal processing applications. This paper illustrates how neural networks are employed in a prediction based preprocessing framework, referred to as neural-time-series-prediction-preprocessing (NTSPP), in an electroencephalogram (EEG)-based brain-computer interface (BCI). NTSPP has been shown to increase feature separability by mapping the original EEG signals via time-series-prediction to a higher dimensional space. Preliminary results of a similar novel framework are also presented where, instead of using predictive NNs, auto-associative NNs are employed and features are extracted from the output of auto-associative NNs trained to specialize on EEG signals for particular brain states. The results show that this preprocessing framework referred to as auto-associative NN preprocessing (ANNP) also has the potential to improve the performance of BCIs. Both the NTSPP and ANNP are compared with and deployed in conjunction with the well know common spatial patterns (CSP) to produce a BCI system which significantly outperforms either approach operating independently and has the potential to produce good performances even with a lower number of EEG channels compared to a multichannel BCI. Multichannel BCIs normally perform better that 2-3 channel BCIs however reducing the number of EEG channels required can positively impact on the time needed to mount electrodes and minimize the obtrusiveness of the electrode montage for the user. It is also shown that NTSPP can improve the potential for employing existing BCI methods with minimal subject-specific parameter tuning to deploy the BCI autonomously. Results are presented with six different classification approaches including various statistical classifiers such as Linear Discriminant Analysis (LDA), Support Vector Machines (SVM) and a Bayes classifier.     

Visualising two-dimensional vector fields using directed halftone cells

Digital halftoning is a technique for converting an image with multiple levels of grey into a bi-level (bitmap) image, typically in preparation for printing on paper. It is standard practice to optimize the halftoning process to reduce the visibility of artifacts that appear as textures within what should be a region of uniform or slowly varying intensity. This paper describes a method of manipulating the halftoning process to cause the texture to give an indication of field direction, while the field magnitude is displayed using the intensity. The method is very fast, and gives an unambiguous indication of direction everywhere in the field. It is suitable for displaying up to about 100×100 samples on a normal size page.     

Correction to: Enhancing attributed network embedding via enriched attribute representations

Applied Intelligence - A Correction to this paper has been published: https://doi.org/10.1007/s10489-021-02706-7     

Network sampling and classification: An investigation of network model representations

Methods for generating a random sample of networks with desired properties are important tools for the analysis of social, biological, and information networks. Algorithm-based approaches to sampling networks have received a great deal of attention in recent literature. Most of these algorithms are based on simple intuitions that associate the full features of connectivity patterns with specific values of only one or two network metrics. Substantive conclusions are crucially dependent on this association holding true. However, the extent to which this simple intuition holds true is not yet known. In this paper, we examine the association between the connectivity patterns that a network sampling algorithm aims to generate and the connectivity patterns of the generated networks, measured by an existing set of popular network metrics. We find that different network sampling algorithms can yield networks with similar connectivity patterns. We also find that the alternative algorithms for the same connectivity pattern can yield networks with different connectivity patterns. We argue that conclusions based on simulated network studies must focus on the full features of the connectivity patterns of a network instead of on the limited set of networkmetrics for a specific network type. This fact has important implications for network data analysis: for instance, implications related to the way significance is currently assessed.