A novel approach based on fully connected weighted bipartite graph for zero-shot learning problems

Author(s):  
P. K. Bhagat ◽  
Prakash Choudhary ◽  
Kh. Manglem Singh
2010 ◽  
pp. 1825-1843
Author(s):  
Gwo-Jen Hwang ◽  
Hsiang Cheng ◽  
Carol H.C. Chu ◽  
Judy C.R. Tseng ◽  
Gwo-Haur Hwang

In the past decades, English learning has received lots of attention all over the world, especially for those who are not native English speakers. Various English learning and testing systems have been developed on the Internet. Nevertheless, most existing English testing systems represent the learning status of a student by assigning that student with a score or grade. This approach makes the student aware of his/her learning status through the score or grade, but the student might be unable to improve his/her learning status without further guidance. In this paper, an intelligent English tense learning and diagnosticsystem is proposed, which is able to identify studentlearning problems on English verb tenses and to provide personalized learning suggestions in accordance with eachstudent’s learning portfolio. Experimental results on hundreds of college students have depicted the superiority of the novel approach.


2021 ◽  
Vol 15 (1) ◽  
pp. 41-55
Author(s):  
Hoang Van Truong ◽  
Nguyen Chi Hieu ◽  
Pham Ngoc Giao ◽  
Nguyen Xuan Phong

Anomaly detection in the sound from machines is an important task in machine monitoring. An autoencoder architecture based on the reconstruction error using a log-Mel spectrogram feature is a conventional approach for this domain. However, because of the non-stationary nature of some sounds from the target machine, such a conventional approach does not perform well in those circumstances. In this paper, we propose a novel approach regarding the choice of used features and a new auto-encoder architecture. We created the Mixed Feature, which is a mixture of different sound representations, and a new deep learning method called Fully-Connected U-Net, a form of autoencoder architecture. With experiments on the same dataset as the baseline system, using the same architecture for all types of machines, the experimental results showed that our methods outperformed the baseline system in terms of the AUC and pAUC evaluation metrics. The optimized model achieved 83.38% AUC and 64.51% pAUC on average overall machine types on the developed dataset and outperformed the published baseline by 13.43% AUC and 8.13% pAUC.


2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Huibin Feng ◽  
Zhaocai Yu ◽  
Jian Guan ◽  
Geng Lin

Energy Internet (EI) is aimed at sustainable computing by integrating various energy forms into a highly flexible grid similar to the Internet. The network subsystems of EI connect different components to enable real-time monitoring, controlling, and management. In this paper, the spectrum allocation problem of the cognitive radio network for EI in a smart city is investigated. The network spectrum allocation with both heterogeneous primary operators and secondary users is formulated as the combinatorial auction problem and then is converted to a subset selection problem on a weighted bipartite graph. We propose a hybrid algorithm to solve the problem. Firstly, the proposed algorithm uses a constructive procedure based on the Kuhn-Munkres algorithm to obtain an initial solution. Then, a local search is used to improve the solution quality. In addition, the truthfulness of the auction is guaranteed by adopting a “Vickrey-like” mechanism. Simulation results show that the performance of the proposed algorithm is better than existing greedy algorithms in terms of the social welfare, seller revenue, buyer satisfaction ratio, and winning buyer ratio.


2021 ◽  
Vol 4 ◽  
Author(s):  
David Gordon ◽  
Panayiotis Petousis ◽  
Henry Zheng ◽  
Davina Zamanzadeh ◽  
Alex A.T. Bui

We present a novel approach for imputing missing data that incorporates temporal information into bipartite graphs through an extension of graph representation learning. Missing data is abundant in several domains, particularly when observations are made over time. Most imputation methods make strong assumptions about the distribution of the data. While novel methods may relax some assumptions, they may not consider temporality. Moreover, when such methods are extended to handle time, they may not generalize without retraining. We propose using a joint bipartite graph approach to incorporate temporal sequence information. Specifically, the observation nodes and edges with temporal information are used in message passing to learn node and edge embeddings and to inform the imputation task. Our proposed method, temporal setting imputation using graph neural networks (TSI-GNN), captures sequence information that can then be used within an aggregation function of a graph neural network. To the best of our knowledge, this is the first effort to use a joint bipartite graph approach that captures sequence information to handle missing data. We use several benchmark datasets to test the performance of our method against a variety of conditions, comparing to both classic and contemporary methods. We further provide insight to manage the size of the generated TSI-GNN model. Through our analysis we show that incorporating temporal information into a bipartite graph improves the representation at the 30% and 60% missing rate, specifically when using a nonlinear model for downstream prediction tasks in regularly sampled datasets and is competitive with existing temporal methods under different scenarios.


2020 ◽  
Vol 8 (5) ◽  
pp. 4763-4769

Now days as the progress of digital image technology, video files raise fast, there is a great demand for automatic video semantic study in many scenes, such as video semantic understanding, content-based analysis, video retrieval. Shot boundary detection is an elementary step for video analysis. However, recent methods are time consuming and perform badly in the gradual transition detection. In this paper we have projected a novel approach for video shot boundary detection using CNN which is based on feature extraction. We designed couple of steps to implement this method for automatic video shot boundary detection (VSBD). Primarily features are extracted using H, V&S parameters based on mean log difference along with implementation of histogram distribution function. This feature is given as an input to CNN algorithm which detects shots which is based on probability function. CNN is implemented using convolution and rectifier linear unit activation matrix which is followed after filter application and zero padding. After downsizing the matrix it is given as a input to fully connected layer which indicates shot boundaries comparing the proposed method with CNN method based on GPU the results are encouraging with substantially high values of precision Recall & F1 measures. CNN methods perform moderately better for animated videos while it excels for complex video which is observed in the results.


Sign in / Sign up

Export Citation Format

Share Document