Projective, Sparse, and Learnable Latent Position Network Models

When modeling network data using a latent position model, it is typical to assume that the nodes' positions are independently and identically distributed. However, this assumption implies the average node degree grows linearly with the number of nodes, which is inappropriate when the graph is thought to be sparse. We propose an alternative assumption---that the latent positions are generated according to a Poisson point process---and show that it is compatible with various levels of sparsity. Unlike other notions of sparse latent position models in the literature, our framework also defines a projective sequence of probability models, thus ensuring consistency of statistical inference across networks of different sizes. We establish conditions for consistent estimation of the latent positions, and compare our results to existing frameworks for modeling sparse networks.Comment: 51 pages, 2 figure

Strain-induced modifications of transport in gated graphene nanoribbons

We investigate the effects of homogeneous and inhomogeneous deformations and edge disorder on the conductance of gated graphene nanoribbons. Under increasing homogeneous strain the conductance of such devices initially decreases before it acquires a resonance structure, and finally becomes completely suppressed at larger strain. Edge disorder induces mode mixing in the contact regions, which can restore the conductance to its ballistic value. The valley-antisymmetric pseudo-magnetic field induced by inhomogeneous deformations leads to the formation of additional resonance states, which either originate from the coupling into Fabry-Perot states that extend through the system, or from the formation of states that are localized near the contacts, where the pseudo-magnetic field is largest. In particular, the n=0 pseudo-Landau level manifests itself via two groups of conductance resonances close to the charge neutrality point.Comment: 10 pages, 6 figure

Deep-FS: a feature selection algorithm for deep Boltzmann machines

A Deep Boltzmann Machine is a model of a Deep Neural Network formed from multiple layers of neurons with nonlinear activation functions. The structure of a Deep Boltzmann Machine enables it to learn very complex relationships between features and facilitates advanced performance in learning of high-level representation of features, compared to conventional Artificial Neural Networks. Feature selection at the input level of Deep Neural Networks has not been well studied, despite its importance in reducing the input features processed by the deep learning model, which facilitates understanding of the data. This paper proposes a novel algorithm, Deep Feature Selection (Deep-FS), which is capable of removing irrelevant features from large datasets in order to reduce the number of inputs which are modelled during the learning process. The proposed Deep-FS algorithm utilizes a Deep Boltzmann Machine, and uses knowledge which is acquired during training to remove features at the beginning of the learning process. Reducing inputs is important because it prevents the network from learning the associations between the irrelevant features which negatively impact on the acquired knowledge of the network about the overall distribution of the data. The Deep-FS method embeds feature selection in a Restricted Boltzmann Machine which is used for training a Deep Boltzmann Machine. The generative property of the Restricted Boltzmann Machine is used to reconstruct eliminated features and calculate reconstructed errors, in order to evaluate the impact of eliminating features. The performance of the proposed approach was evaluated with experiments conducted using the MNIST, MIR-Flickr, GISETTE, MADELON and PANCAN datasets. The results revealed that the proposed Deep-FS method enables improved feature selection without loss of accuracy on the MIR-Flickr dataset, where Deep-FS reduced the number of input features by removing 775 features without reduction in performance. With regards to the MNIST dataset, Deep-FS reduced the number of input features by more than 45%; it reduced the network error from 0.97% to 0.90%, and also reduced processing and classification time by more than 5.5%. Additionally, when compared to classical feature selection methods, Deep-FS returned higher accuracy. The experimental results on GISETTE, MADELON and PANCAN showed that Deep-FS reduced 81%, 57% and 77% of the number of input features, respectively. Moreover, the proposed feature selection method reduced the classifier training time by 82%, 70% and 85% on GISETTE, MADELON and PANCAN datasets, respectively. Experiments with various datasets, comprising a large number of features and samples, revealed that the proposed Deep-FS algorithm overcomes the main limitations of classical feature selection algorithms. More specifically, most classical methods require, as a prerequisite, a pre-specified number of features to retain, however in Deep-FS this number is identified automatically. Deep-FS performs the feature selection task faster than classical feature selection algorithms which makes it suitable for deep learning tasks. In addition, Deep-FS is suitable for finding features in large and big datasets which are normally stored in data batches for faster and more efficient processing

Breast cancer diagnosis using a hybrid genetic algorithm for feature selection based on mutual information

Feature Selection is the process of selecting a subset of relevant features (i.e. predictors) for use in the construction of predictive models. This paper proposes a hybrid feature selection approach to breast cancer diagnosis which combines a Genetic Algorithm (GA) with Mutual Information (MI) for selecting the best combination of cancer predictors, with maximal discriminative capability. The selected features are then input into a classifier to predict whether a patient has breast cancer. Using a publicly available breast cancer dataset, experiments were performed to evaluate the performance of the Genetic Algorithm based on the Mutual Information approach with two different machine learning classifiers, namely the k-Nearest Neighbor (KNN), and Support vector machine (SVM), each tuned using different distance measures and kernel functions, respectively. The results revealed that the proposed hybrid approach is highly accurate for predicting breast cancer, and it is very promising for predicting other cancers using clinical data

Bio-inspired ganglion cell models for detecting horizontal and vertical movements

The retina performs the earlier stages of image processing in living beings and is composed of six different groups of cells, namely, the rods, cones, horizontal, bipolar, amacrine and ganglion cells. Each of those group of cells can be sub-divided into other types of cells that vary in shape, size, connectivity and functionality. Each cell is responsible for performing specific tasks in these early stages of biological image processing. Some of those cells are sensitive to horizontal and vertical movements. This paper proposes a multi-hierarchical spiking neural network architecture for detecting horizontal and vertical movements using a custom dataset which was generated in laboratory settings. The proposed architecture was designed to reflect the connectivity, behaviour and the number of layers found in the majority of vertebrates retinas, including humans. The architecture was trained using 2303 images and tested using 816 images. Simulation results revealed that each cell model is sensitive to vertical and horizontal movements with a detection error of 6.75 percent

Sustainable development and european banks: A non-financial disclosure analysis

none4noThis paper aims at contributing to the debate on the relationships between the European financial sector and sustainable development. Using a non-financial disclosure analysis of 262 European banks, the research sought, first, to investigate the "scope" of the contribution of European banks to the Sustainable Development Goals (SDGs) and, second, to explore the factors that seem to differentiate the SDGs approach among banks. The results show that country of origin, legal system, and adoption of an integrated report seem to differentiate banks in terms of contribution to the SDGs. The business model and stock exchange listing, conversely, do not seem to represent discriminatory factor in the contribution of banks toward the SDGs. The study can be useful for managers and decision makers to develop policies to support organizations in contributing to the SDGs.openCosma S.; Venturelli A.; Schwizer P.; Boscia V.Cosma, S.; Venturelli, A.; Schwizer, P.; Boscia, V

Hawkes process as a model of social interactions: a view on video dynamics

We study by computer simulation the "Hawkes process" that was proposed in a recent paper by Crane and Sornette (Proc. Nat. Acad. Sci. USA 105, 15649 (2008)) as a plausible model for the dynamics of YouTube video viewing numbers. We test the claims made there that robust identification is possible for classes of dynamic response following activity bursts. Our simulated timeseries for the Hawkes process indeed fall into the different categories predicted by Crane and Sornette. However the Hawkes process gives a much narrower spread of decay exponents than the YouTube data, suggesting limits to the universality of the Hawkes-based analysis.Comment: Added errors to parameter estimates and further description. IOP style, 13 pages, 5 figure