42,934 research outputs found
On Obtaining Stable Rankings
Decision making is challenging when there is more than one criterion to
consider. In such cases, it is common to assign a goodness score to each item
as a weighted sum of its attribute values and rank them accordingly. Clearly,
the ranking obtained depends on the weights used for this summation. Ideally,
one would want the ranked order not to change if the weights are changed
slightly. We call this property {\em stability} of the ranking. A consumer of a
ranked list may trust the ranking more if it has high stability. A producer of
a ranked list prefers to choose weights that result in a stable ranking, both
to earn the trust of potential consumers and because a stable ranking is
intrinsically likely to be more meaningful. In this paper, we develop a
framework that can be used to assess the stability of a provided ranking and to
obtain a stable ranking within an "acceptable" range of weight values (called
"the region of interest"). We address the case where the user cares about the
rank order of the entire set of items, and also the case where the user cares
only about the top- items. Using a geometric interpretation, we propose
algorithms that produce stable rankings. In addition to theoretical analyses,
we conduct extensive experiments on real datasets that validate our proposal
IMPROVING THE DEVELOPMENT MANAGEMENT PROCESS OF THE UNIVERSITIES: WAYS OF INTEGRATION INTO THE GLOBAL EDUCATION SPACE
The basic in changes ranking of national universities in the global educational space were defined, the major directions for development of educational services and academic achievements to ensure growth in ranking were substantiated. Tools for creation of the complex management system of ranking were proposed.The basic in changes ranking of national universities in the global educational space were defined, the major directions for development of educational services and academic achievements to ensure growth in ranking were substantiated. Tools for creation of the complex management system of ranking were proposed
Netter: re-ranking gene network inference predictions using structural network properties
Background: Many algorithms have been developed to infer the topology of gene regulatory networks from gene expression data. These methods typically produce a ranking of links between genes with associated confidence scores, after which a certain threshold is chosen to produce the inferred topology. However, the structural properties of the predicted network do not resemble those typical for a gene regulatory network, as most algorithms only take into account connections found in the data and do not include known graph properties in their inference process. This lowers the prediction accuracy of these methods, limiting their usability in practice.
Results: We propose a post-processing algorithm which is applicable to any confidence ranking of regulatory interactions obtained from a network inference method which can use, inter alia, graphlets and several graph-invariant properties to re-rank the links into a more accurate prediction. To demonstrate the potential of our approach, we re-rank predictions of six different state-of-the-art algorithms using three simple network properties as optimization criteria and show that Netter can improve the predictions made on both artificially generated data as well as the DREAM4 and DREAM5 benchmarks. Additionally, the DREAM5 E. coli. community prediction inferred from real expression data is further improved. Furthermore, Netter compares favorably to other post-processing algorithms and is not restricted to correlation-like predictions. Lastly, we demonstrate that the performance increase is robust for a wide range of parameter settings. Netter is available at http://bioinformatics. intec. ugent. be.
Conclusions: Network inference from high-throughput data is a long-standing challenge. In this work, we present Netter, which can further refine network predictions based on a set of user-defined graph properties. Netter is a flexible system which can be applied in unison with any method producing a ranking from omics data. It can be tailored to specific prior knowledge by expert users but can also be applied in general uses cases. Concluding, we believe that Netter is an interesting second step in the network inference process to further increase the quality of prediction
Voting for candidates: adapting data fusion techniques for an expert search task
In an expert search task, the users' need is to identify people who have relevant expertise to a topic of interest. An expert search system predicts and ranks the expertise of a set of candidate persons with respect to the users' query. In this paper, we propose a novel approach for predicting and ranking candidate expertise with respect to a query. We see the problem of ranking experts as a voting problem, which we model by adapting eleven data fusion techniques.We investigate the effectiveness of the voting approach and the associated data fusion techniques across a range of document weighting models, in the context of the TREC 2005 Enterprise track. The evaluation results show that the voting paradigm is very effective, without using any collection specific heuristics. Moreover, we show that improving the quality of the underlying document representation can significantly improve the retrieval performance of the data fusion techniques on an expert search task. In particular, we demonstrate that applying field-based weighting models improves the ranking of candidates. Finally, we demonstrate that the relative performance of the adapted data fusion techniques for the proposed approach is stable regardless of the used weighting models
Fictitious students creation incentives in school choice problems
We address the question of whether schools can manipulate the student-optimal stable mechanism by creating fictitious students in school choice problems. To this end, we introduce two different manipulation concepts, where one of them is stronger. We first demonstrate that the student-optimal stable mechanism is not even weakly fictitious student-proof under general priority structures. Then, we investigate the same question under acyclic priority structures. We prove that, while the student-optimal stable mechanism is not strongly fictitious student-proof even under the acyclicity condition, weak fictitious student-proofness is achieved under acyclicity. This paper, hence, shows a way to avoid the welfare detrimental fictitious students creation (in the weak sense) in terms of priority structures
Poor by Comparison: Report on Illinois Poverty
A report that examines how Illinois compares to other states on over 25 key metrics associated with poverty and hardship. In addition to addressing the state budget's structural deficit and tax policy, the report offers additional recommendations that, if implemented, would help ensure the people of Illinois can live the best lives possible and make Illinois more competitive in the process
- …