Dotnet a graph-based consensus maximization approach for combining multiple supervised and unsupervised models

•

0 likes•16 views

Ecwaytech

What's hot

Numerical methods and its applications

HaiderParekh1

real life application in numerical method

Daffodil international University

Dadm (lys)

SameeriMamillapalli

Meta Learning Shared Hierarchies

Yoonho Lee

Energy Behaviour and Smart Meters

SEA - Sustainable Energy Advice Ltd

Machine learning

AgradeepSett

Poster systems

Maria Kapsali

What's hot (7)

Numerical methods and its applications

real life application in numerical method

Dadm (lys)

Meta Learning Shared Hierarchies

Energy Behaviour and Smart Meters

Machine learning

Poster systems

Viewers also liked

Identifying cost behavior classifications

azmatmengal

Dotnet on the real-time hardware implementation feasibility of joint radio r...

Ecwaytech

como hacer un blog Alba Rodriguez

alba_rg_

Dotnet a rough-set-based incremental approach for updating approximations un...

Ecwaytech

TGIS 2013

Dongpo Deng

This book is a blend of history and fiction for a readable personified presentation of the Hindu mindset which appeared in the later half of the nineteenth century, after the demise of the Mughal Empire and the end of the Muslim rule in India. It is a saga in a racy narrative of the life and time of a man who was extraordinarily intelligent, an intrepid fighter for his convictions, a master strategist and a fearless nationalist personifying the Hindu psyche of the post-Mughal renaissance period seeking inspiration from Chanakya’s Takshashila.

The Road To Takshashila

Shashank Jaitely

Виды информационных процессов

Виктор Леонидович Ярославцев

Debarquement en-normandie-1

Dominique Pongi

Dotnet a survey of xml tree patterns

Ecwaytech

Misthologikes kai syntaksiodotikes_rithmiseis_ekpaideytikin

Spiros Paras

ugrmagbil

Ivan Marin Denys

My friend is a real sportsmen

prosvsports

Publika Brasil Apresentação

Adilso Souza Mmn

Clasificación fondos de inversión

Angelica_Narbona

Dotnet a proxy-based approach to continuous location-based spatial queries i...

Ecwaytech

Dotnet a generalized flow-based method for analysis of implicit relationship...

Ecwaytech

Dotnet a secure payment scheme with low communication and processing overhea...

Ecwaytech

The ultrasonic distance alarm system based on msp430 f449

Ecwaytech

Dotnet a resource allocation scheme for scalable video multicast in wi max r...

Ecwaytech

Dotnet a scalable server architecture for mobile presence services in social...

Ecwaytech

Viewers also liked (20)

Identifying cost behavior classifications

Dotnet on the real-time hardware implementation feasibility of joint radio r...

como hacer un blog Alba Rodriguez

Dotnet a rough-set-based incremental approach for updating approximations un...

TGIS 2013

The Road To Takshashila

Виды информационных процессов

Debarquement en-normandie-1

Dotnet a survey of xml tree patterns

Misthologikes kai syntaksiodotikes_rithmiseis_ekpaideytikin

ugrmagbil

My friend is a real sportsmen

Publika Brasil Apresentação

Clasificación fondos de inversión

Dotnet a proxy-based approach to continuous location-based spatial queries i...

Dotnet a generalized flow-based method for analysis of implicit relationship...

Dotnet a secure payment scheme with low communication and processing overhea...

The ultrasonic distance alarm system based on msp430 f449

Dotnet a resource allocation scheme for scalable video multicast in wi max r...

Dotnet a scalable server architecture for mobile presence services in social...

Similar to Dotnet a graph-based consensus maximization approach for combining multiple supervised and unsupervised models

A graph based consensus maximization approach for combining multiple supervis...

ecway

Java a graph-based consensus maximization approach for combining multiple su...

ecwayerode

Homomorphic encryption (HE) permits users to perform computations on encrypted data without first decrypting it. HE can be used for privacy-preserving outsourced computation and analysis, allowing data to be encrypted and outsourced to commercial cloud environments for processing while encrypted or sensitive data. HE enables new services by removing privacy barriers inhibiting data sharing or increasing the security of existing services. A convolution neural network (CNN) can be homomorphically evaluated using addition and multiplication by replacing the activation function, such as Rectified Linear Units (ReLU), with a low polynomial degree. To achieve the same performance as the ReLU activation function, we study the impact of applying the ensemble techniques to solve the accuracy problem. Our experimental results empirically show that the ensemble approach can reduce bias, and variance, increasing accuracy to achieve the same ReLU performance with parallel and sequential techniques. We demonstrate the effectiveness and robustness of our method using three datasets: MNIST, FMNIST, and CIFAR-10.

An Ensemble Approach To Improve Homomorphic Encrypted Data Classification Per...

IJCI JOURNAL

Web-based learning technologies of educational institutions store a massive amount of interaction data which can be helpful to predict students’ performance through the aid of machine learning algorithms. With this, various researchers focused on studying ensemble learning methods as it is known to improve the predictive accuracy of traditional classification algorithms. This study proposed an approach for enhancing the performance prediction of different single classification algorithms by using them as base classifiers of homogeneous ensembles (bagging and boosting) and heterogeneous ensembles (voting and stacking). The model utilized various single classifiers such as multilayer perceptron or neural networks (NN), random forest (RF), naïve Bayes (NB), J48, JRip, OneR, logistic regression (LR), k-nearest neighbor (KNN), and support vector machine (SVM) to determine the base classifiers of the ensembles. In addition, the study made use of the University of California Irvine (UCI) open-access student dataset to predict students’ performance. The comparative analysis of the model’s accuracy showed that the best-performing single classifier’s accuracy increased further from 93.10% to 93.68% when used as a base classifier of a voting ensemble method. Moreover, results in this study showed that voting heterogeneous ensemble performed slightly better than bagging and boosting homogeneous ensemble methods.

An approach for improved students’ performance prediction using homogeneous ...

IJECEIAES

IEEE Datamining 2016 Title and Abstract

tsysglobalsolutions

IEEE 2014 MATLAB IMAGE PROCESSING PROJECTS Multi label image categorization w...

IEEEBEBTECHSTUDENTPROJECTS

Ieee transactions on 2018 knowledge and data engineering topics with abstract .

tsysglobalsolutions

Strategies for energy efficient resource management of hybrid programming models

Ecwayt

Dotnet strategies for energy-efficient resource management of hybrid program...

Ecwaytech

This paper presents an approach based on applying an aggregated predictor formed by multiple versions of a multilayer neural network with a back-propagation optimization algorithm for helping the engineer to get a list of the most appropriate well-test interpretation models for a given set of pressure/ production data. The proposed method consists of three stages: (1) data decorrelation through principal component analysis to reduce the covariance between the variables and the dimension of the input layer in the artificial neural network, (2) bootstrap replicates of the learning set where the data is repeatedly sampled with a random split of the data into train sets and using these as new learning sets, and (3) automatic reservoir model identification through aggregated predictor formed by a plurality vote when predicting a new class. This method is described in detail to ensure successful replication of results. The required training and test dataset were generated by using analytical solution models. In our case, there were used 600 samples: 300 for training, 100 for cross-validation, and 200 for testing. Different network structures were tested during this study to arrive at optimum network design. We notice that the single net methodology always brings about confusion in selecting the correct model even though the training results for the constructed networks are close to 1. We notice also that the principal component analysis is an effective strategy in reducing the number of input features, simplifying the network structure, and lowering the training time of the ANN. The results obtained show that the proposed model provides better performance when predicting new data with a coefficient of correlation approximately equal to 95% Compared to a previous approach 80%, the combination of the PCA and ANN is more stable and determine the more accurate results with lesser computational complexity than was feasible previously. Clearly, the aggregated predictor is more stable and shows less bad classes compared to the previous approach.

AN IMPROVED METHOD FOR IDENTIFYING WELL-TEST INTERPRETATION MODEL BASED ON AG...

IAEME Publication

Maximum likelihood estimation from uncertain data in the belief function fram...

ecwayprojects

Dotnet maximum likelihood estimation from uncertain data in the belief funct...

Ecwayt

Dotnet maximum likelihood estimation from uncertain data in the belief funct...

Ecwaytech

The impressive predictive performance of deep learning techniques on a wide range of tasks has led to its widespread use. Estimating the confidence of these predictions is paramount for improving the safety and reliability of such systems. However, the uncertainty estimates provided by neural networks (NNs) tend to be overconfident and unreasonable. Previous studies have found out that ensemble of NNs typically produce good predictions and uncertainty estimates. Inspired by these, this paper presents a new framework that can quantitatively estimate the uncertainties by leveraging the advances in multi-task learning through slight modification to the existing training pipelines. This promising algorithm is developed with an intention of deployment in real world problems which already boast a good predictive performance by reusing those pretrained models. The idea is to capture the behavior of the trained NNs for the base task by augmenting it with the uncertainty estimates from a supplementary network. A series of experiments show that the proposed approach produces well calibrated uncertainty estimates with high quality predictions.

UNCERTAINTY ESTIMATION IN NEURAL NETWORKS THROUGH MULTI-TASK LEARNING

gerogepatton

UNCERTAINTY ESTIMATION IN NEURAL NETWORKS THROUGH MULTI-TASK LEARNING

ijaia

Abstract: Active learning aims to select samples to be annotated that yield the largest performance improvement for the learning algorithm. Many methods approach this problem by measuring the informativeness of samples and do this based on the certainty of the network predictions for samples. However, it is well-known that neural networks are overly confident about their prediction and are therefore an untrustworthy source to assess sample informativeness. In this paper, we propose a new informativeness-based active learning method. Our measure is derived from the learning dynamics of a neural network. More precisely we track the label assignment of the unlabeled data pool during the training of the algorithm. We capture the learning dynamics with a metric called label-dispersion, which is low when the network consistently assigns the same label to the sample during the training of the network and high when the assigned label changes frequently. We show that label-dispersion is a promising predictor of the uncertainty of the network, and show on two benchmark datasets that an active learning algorithm based on label-dispersion obtains excellent results.

When deep learners change their mind learning dynamics for active learning

Devansh16

IEEE Pattern analysis and machine intelligence 2016 Title and Abstract

tsysglobalsolutions

Conventional methods for causal structure learning from data face significant challenges due to combinatorial search space. Recently, the problem has been formulated into a continuous optimization framework with an acyclicity constraint to learn Directed Acyclic Graphs (DAGs). Such a framework allows the utilization of deep generative models for causal structure learning to better capture the relations between data sample distributions and DAGs. However, so far no study has experimented with the use of Wasserstein distance in the context of causal structure learning. Our model named DAG-WGAN combines the Wasserstein-based adversarial loss with an acyclicity constraint in an auto-encoder architecture. It simultaneously learns causal structures while improving its data generation capability. We compare the performance of DAG-WGAN with other models that do not involve the Wasserstein metric in order to identify its contribution to causal structure learning. Our model performs better with high cardinality data according to our experiments.

CAUSALITY LEARNING WITH WASSERSTEIN GENERATIVE ADVERSARIAL NETWORKS

gerogepatton

CAUSALITY LEARNING WITH WASSERSTEIN GENERATIVE ADVERSARIAL NETWORKS

ijaia

Clustering large probabilistic graphs

Ecway2004

Similar to Dotnet a graph-based consensus maximization approach for combining multiple supervised and unsupervised models (20)