Automatic image annotation is a promising solution to narrow the semantic gap between low-level content and high-level semantic concept, which has been an active research area in the fields of image retrieval, pattern recognition, and machine learning. However, even the most dedicated annotation algorithms are often unsatisfactory. Image annotation refinement has attracted much more attention r...

The paper presents baseline and complex part-of-speech taggers applied to the modified corpus of Frequency Dictionary of Contemporary Polish, annotated with a large tagset. First, the paper examines accuracy of 6 baseline part-of-speech taggers. The main part of the work presents simple weighted voting and complex voting taggers. Special attention is paid to lexical voting methods and issues of...

False positives (FPs) and false negatives (FNs) happen in every Intrusion Detection System (IDS). How often they occur is regarded as a measurement of the accuracy of the system. Frequent occurrences of FPs not only reduce the throughput of an IDS as FPs block the normal traffic and also degrade its trustworthiness. It is also difficult to eradicate all FNs from an IDS. One way to overcome the ...

Weighted voting games (WVGs) are a class of cooperative games that capture settings of group decision making in various domains, such as parliaments or committees. Earlier work has revealed that the effective decision making power, or influence of agents in WVGs is not necessarily proportional to their weight. This gave rise to measures of influence for WVGs. However, recent work in the algorit...

3 Experiment I: Evaluation of classifiers using COSMIC v.50 5 3.1 Cost-Sensitive Classifier . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 3.2 Comparison of COSMIC All and COSMIC FG1 . . . . . . . . . . . . . . . . . . . . . 6 3.3 Ranking of 177 Putative EGFR Mutations COSMIC v.50 . . . . . . . . . . . . . . 7 3.3.1 Majority voting approach . . . . . . . . . . . . . . . ....

In this work we examine power measures used in the analysis of voting games to quantify power. We consider both weighted and non-weighted voting games giving simple examples of each. The power indices considered are the Shapley-Shubik [8] index, the Banzho index [1], the Penrose [7] index and Coleman [2] indices. We apply them to speci c examples taken from recent Canadian parliaments and to th...

Weighted voting games are frequently used in decision making. Each voter has a weight and a proposal is accepted if the weight sum of the supporting voters exceeds a quota. One line of research is the efficient computation of so-called power indices measuring the influence of a voter. We treat the inverse problem: Given an influence vector and a power index, determine a weighted voting game suc...

In this work, we study the behavior of Brazilian politicians and political parties with the help of clustering algorithms for signed social networks. For this purpose, we extract and analyze a collection of signed networks representing voting sessions of the lower house of Brazilian National Congress. We process all available voting data for the period between 2011 and 2016, by considering voti...

A priori voting power analysis can be useful in helping to design a weighted voting system that has certain intended properties. Power indices can help determine how many weighted votes each member should be allocated and what the decision rule should be. These choices can be made in the light of a requirement that there be a given distribution of power and/or a desired division of powers betwe...