scholarly journals Multi Label Ranking Based on Positive Pairwise Correlations Among Labels

2019 ◽  
Vol 17 (4) ◽  
pp. 440-449
Author(s):  
Raed Alazaidah ◽  
Farzana Ahmad ◽  
Mohamad Mohsin
Keyword(s):  
General Type ◽  
Superior Performance ◽  
Evaluation Metrics ◽  
Ranking Algorithm ◽  
Problem Transformation ◽  
Pairwise Correlations ◽  
Label Ranking ◽  
Transformation Methods

Multi-Label Classification (MLC) is a general type of classification that has attracted many researchers in the last few years. Two common approaches are being used to solve the problem of MLC: Problem Transformation Methods (PTMs) and Algorithm Adaptation Methods (AAMs). This Paper is more interested in the first approach; since it is more general and applicable to any domain. In specific, this paper aims to meet two objectives. The first objective is to propose a new multi-label ranking algorithm based on the positive pairwise correlations among labels, while the second objective aims to propose new simple PTMs that are based on labels correlations, and not based on labels frequency as in conventional PTMs. Experiments showed that the proposed algorithm overcomes the existing methods and algorithms on all evaluation metrics that have been used in the experiments. Also, the proposed PTMs show a superior performance when compared with the existing PTMs

scholarly journals Enhancing Wind Turbine Power Forecast via Convolutional Neural Network

Electronics ◽  
2021 ◽  
Vol 10 (3) ◽  
pp. 261
Author(s):  
Tianyang Liu ◽  
Zunkai Huang ◽  
Li Tian ◽  
Yongxin Zhu ◽  
Hui Wang ◽  
...  
Keyword(s):  
Time Series ◽  
Wind Speed ◽  
Wind Turbine ◽  
Wind Power ◽  
Rapid Development ◽  
Superior Performance ◽  
Learning Platform ◽  
Novel Approach ◽  
Wind Power Forecast ◽  
Transformation Methods

The rapid development in wind power comes with new technical challenges. Reliable and accurate wind power forecast is of considerable significance to the electricity system’s daily dispatching and production. Traditional forecast methods usually utilize wind speed and turbine parameters as the model inputs. However, they are not sufficient to account for complex weather variability and the various wind turbine features in the real world. Inspired by the excellent performance of convolutional neural networks (CNN) in computer vision, we propose a novel approach to predicting short-term wind power by converting time series into images and exploit a CNN to analyze them. In our approach, we first propose two transformation methods to map wind speed and precipitation data time series into image matrices. After integrating multi-dimensional information and extracting features, we design a novel CNN framework to forecast 24-h wind turbine power. Our method is implemented on the Keras deep learning platform and tested on 10 sets of 3-year wind turbine data from Hangzhou, China. The superior performance of the proposed method is demonstrated through comparisons using state-of-the-art techniques in wind turbine power forecasting.

Accurate Image Retrieval With Unsupervised 2-Stage k-NN Re-Ranking

2018 ◽  
pp. 1726-1745
Author(s):  
Dawei Li ◽  
Mooi Choo Chuah
Keyword(s):  
Image Retrieval ◽  
Large Scale ◽  
Ground Truth ◽  
Confidence Score ◽  
Image Feature ◽  
Superior Performance ◽  
Ranking Algorithm ◽  
Ranking List ◽  
Image Patches ◽  
Benchmark Datasets

Many state-of-the-art image retrieval systems include a re-ranking step to refine the suggested initial ranking list so as to improve the retrieval accuracy. In this paper, we present a novel 2-stage k-NN re-ranking algorithm. In stage one, we generate an expanded list of candidate database images for re-ranking so that lower ranked ground truth images will be included and re-ranked. In stage two, we re-rank the list of candidate images using a confidence score which is calculated based on, rRBO, a new proposed ranking list similarity measure. In addition, we propose the rLoCATe image feature, which captures robust color and texture information on salient image patches, and shows superior performance in the image retrieval task. We evaluate the proposed re-ranking algorithm on various initial ranking lists created using both SIFT and rLoCATe on two popular benchmark datasets along with a large-scale one million distraction dataset. The results show that our proposed algorithm is not sensitive for different parameter configurations and it outperforms existing k-NN re-ranking methods.

scholarly journals Multi-label Problem Transformation Methods: a Case Study

2011 ◽  
Vol 14 (1) ◽  
Author(s):  
Everton Alvares Cherman ◽  
Maria Carolina Monard ◽  
Jean Metz
Keyword(s):  
Classification Problem ◽  
Learning Problems ◽  
Classification Algorithms ◽  
Classification Problems ◽  
Practical Applications ◽  
Problem Transformation ◽  
Textual Data ◽  
Traditional Classification ◽  
Transformation Methods

Traditional classification algorithms consider learning problems that contain only one label, i.e., each example is associated with one single nominal target variable characterizing its property. However, the number of practical applications involving data with multiple target variables has increased. To learn from this sort of data, multi-label classification algorithms should be used. The task of learning from multi-label data can be addressed by methods that transform the multi-label classification problem into several single-label classification problems. In this work, two well known methods based on this approach are used, as well as a third method we propose to overcome some deficiencies of one of them, in a case study using textual data related to medical findings, which were structured using the bag-of-words approach. The experimental study using these three methods shows an improvement on the results obtained by our proposed multi-label classification method.

A multi-objective approach to determining the usefulness of papers in academic search

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Shah Khalid ◽  
Shengli Wu ◽  
Fang Zhang
Keyword(s):  
Search Engine ◽  
Computational Linguistics ◽  
Design Methodology ◽  
Research Community ◽  
Evaluation Metrics ◽  
Ranking Algorithm ◽  
Content Type ◽  
Multi Objective ◽  
Academic Search ◽  
Ranked List

PurposeHow to provide the most useful papers for searchers is a key issue for academic search engines. A lot of research has been carried out to address this problem. However, when evaluating the effectiveness of an academic search engine, most of the previous investigations assume that the only concern of the user is the relevancy of the paper to the query. The authors believe that the usefulness of a paper is determined not only by its relevance to the query but also by other aspects including its publication age and impact in the research community. This is vital, especially when a large number of papers are relevant to the query.Design/methodology/approachThis paper proposes a group of metrics to measure the usefulness of a ranked list of papers. When defining these metrics, three factors, including relevance, publication age and impact, are considered at the same time. To accommodate this, the authors propose a framework to rank papers by a combination of their relevance, publication age and impact scores.FindingsThe framework is evaluated with the ACL (Association for Computational Linguistics Anthology Network) dataset. It demonstrates that the proposed ranking algorithm is effective for improving usefulness when two or three aspects of academic papers are considered at the same time, while the relevance of the retrieved papers is slightly down compared with the relevance-only retrieval.Originality/valueTo the best of the authors’ knowledge, the proposed multi-objective academic search framework is the first of its kind that is proposed and evaluated with a group of new evaluation metrics.

Sign in / Sign up

Export Citation Format

Share Document