Search Results Heading

MBRLSearchResults

mbrl.module.common.modules.added.book.to.shelf
Title added to your shelf!
View what I already have on My Shelf.
Oops! Something went wrong.
Oops! Something went wrong.
While trying to add the title to your shelf something went wrong :( Kindly try again later!
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
    Done
    Filters
    Reset
  • Language
      Language
      Clear All
      Language
  • Subject
      Subject
      Clear All
      Subject
  • Item Type
      Item Type
      Clear All
      Item Type
  • Discipline
      Discipline
      Clear All
      Discipline
  • Year
      Year
      Clear All
      From:
      -
      To:
  • More Filters
78 result(s) for "[INFO] Computer Science [cs]"
Sort by:
Extreme-value-theoretic estimation of local intrinsic dimensionality
This paper is concerned with the estimation of a local measure of intrinsic dimensionality (ID) recently proposed by Houle. The local model can be regarded as an extension of Karger and Ruhl’s expansion dimension to a statistical setting in which the distribution of distances to a query point is modeled in terms of a continuous random variable. This form of intrinsic dimensionality can be particularly useful in search, classification, outlier detection, and other contexts in machine learning, databases, and data mining, as it has been shown to be equivalent to a measure of the discriminative power of similarity functions. Several estimators of local ID are proposed and analyzed based on extreme value theory, using maximum likelihood estimation, the method of moments, probability weighted moments, and regularly varying functions. An experimental evaluation is also provided, using both real and artificial data.
The Open International Soccer Database for machine learning
How well can machine learning predict the outcome of a soccer game, given the most commonly and freely available match data? To help answer this question and to facilitate machine learning research in soccer, we have developed the Open International Soccer Database. Version v1.0 of the Database contains essential information from 216,743 league soccer matches from 52 leagues in 35 countries. The earliest entries in the Database are from the year 2000, which is when football leagues generally adopted the “three points for a win” rule. To demonstrate the use of the Database for machine learning research, we organized the 2017 Soccer Prediction Challenge. One of the goals of the Challenge was to estimate where the limits of predictability lie, given the type of match data contained in the Database. Another goal of the Challenge was to pose a real-world machine learning problem with a fixed time line and a genuine prediction task: to develop a predictive model from the Database and then to predict the outcome of the 206 future soccer matches taking place from 31 March 2017 to the end of the regular season. The Open International Soccer Database is released as an open science project, providing a valuable resource for soccer analysts and a unique benchmark for advanced machine learning methods. Here, we describe the Database and the 2017 Soccer Prediction Challenge and its results.
Adapting Passive Microwave-Based Precipitation Algorithms to Variable Microwave Land Surface Emissivity to Improve Precipitation Estimation from the GPM Constellation
A fully global satellite-based precipitation estimate that can transition across the changing Earth surface and complex land/water conditions is an important capability for many hydrological applications, and for independent evaluation of the precipitation derived from weather and climate models. This capability is inherently challenging owing to the complexity of the surface geophysical properties upon which the satellite-based instruments view. To date, these satellite observations originate primarily from a variety of wide-swath passive microwave (MW) imagers and sounders. In contrast to open ocean and large water bodies, the surface emissivity contribution to passive MW measurements is much more variable for land surfaces, with varying sensitivities to near-surface precipitation. The NASA–JAXA Global Precipitation Measurement (GPM) spacecraft (2014–present) is equipped with a dual-frequency precipitation radar and a multichannel passive MW imaging radiometer specifically designed for precipitation measurement, covering substantially more land area than its predecessor Tropical Rainfall Measuring Mission (TRMM). The synergy between GPM’s instruments has guided a number of new frameworks for passive MW precipitation retrieval algorithms, whereby the information carried by the single narrow-swath precipitation radar is exploited to recover precipitation from a disparate constellation of passive MW imagers and sounders. With over 6 years of increased land surface coverage provided by GPM, new insight has been gained into the nature of the microwave surface emissivity over land and ice/snow-covered surfaces, leading to improvements in a number of physically and semiphysically based precipitation retrieval techniques that adapt to variable Earth surface conditions. In this manuscript, the workings and capabilities of several of these approaches are highlighted.
A model of anytime algorithm performance for bi-objective optimization
Anytime algorithms allow a practitioner to trade-off runtime for solution quality. This is of particular interest in multi-objective combinatorial optimization since it can be infeasible to identify all efficient solutions in a reasonable amount of time. We present a theoretical model that, under some mild assumptions, characterizes the “optimal” trade-off between runtime and solution quality, measured in terms of relative hypervolume, of anytime algorithms for bi-objective optimization. In particular, we assume that efficient solutions are collected sequentially such that the collected solution at each iteration maximizes the hypervolume indicator, and that the non-dominated set can be well approximated by a quadrant of a superellipse. We validate our model against an “optimal” model that has complete knowledge of the non-dominated set. The empirical results suggest that our theoretical model approximates the behavior of this optimal model quite well. We also analyze the anytime behavior of an ε-constraint algorithm, and show that our model can be used to guide the algorithm and improve its anytime behavior.
Unified Polynomial Dynamic Programming Algorithms for P-Center Variants in a 2D Pareto Front
With many efficient solutions for a multi-objective optimization problem, this paper aims to cluster the Pareto Front in a given number of clusters K and to detect isolated points. K-center problems and variants are investigated with a unified formulation considering the discrete and continuous versions, partial K-center problems, and their min-sum-K-radii variants. In dimension three (or upper), this induces NP-hard complexities. In the planar case, common optimality property is proven: non-nested optimal solutions exist. This induces a common dynamic programming algorithm running in polynomial time. Specific improvements hold for some variants, such as K-center problems and min-sum K-radii on a line. When applied to N points and allowing to uncover M
Improving topic modeling through homophily for legal documents
Topic modeling that can automatically assign topics to legal documents is very important in the domain of computational law. The relevance of the modeled topics strongly depends on the legal context they are used in. On the other hand, references to laws and prior cases are key elements for judges to rule on a case. Taken together, these references form a network, whose structure can be analysed with network analysis. However, the content of the referenced documents may not be always accessed. Even in that case, the reference structure itself shows that documents share latent similar characteristics. We propose to use this latent structure to improve topic modeling of law cases using document homophily. In this paper, we explore the use of homophily networks extracted from two types of references: prior cases and statute laws, to enhance topic modeling on legal case documents. We conduct in detail, an analysis on a dataset consisting of rich legal cases, i.e., the COLIEE dataset, to create these networks. The homophily networks consist of nodes for legal cases, and edges with weights for the two families of references between the case nodes. We further propose models to use the edge weights for topic modeling. In particular, we propose a cutting model and a weighting model to improve the relational topic model (RTM). The cutting model uses edges with weights higher than a threshold as document links in RTM; the weighting model uses the edge weights to weight the link probability function in RTM. The weights can be obtained either from the co-citations or from the cosine similarity based on an embedding of the homophily networks. Experiments show that the use of the homophily networks for topic modeling significantly outperforms previous studies, and the weighting model is more effective than the cutting model.
Online community management as social network design: testing for the signature of management activities in online communities
Online communities are used across several fields of human activities, as environments for large-scale collaboration. Most successful ones employ professionals, sometimes called “community managers” or “moderators”, for tasks including onboarding new participants, mediating conflict, and policing unwanted behaviour. Network scientists routinely model interaction across participants in online communities as social networks. We interpret the activity of community managers as (social) network design: they take action oriented at shaping the network of interactions in a way conducive to their community’s goals. It follows that, if such action is successful, we should be able to detect its signature in the network itself. Growing networks where links are allocated by a preferential attachment mechanism are known to converge to networks displaying a power law degree distribution. Growth and preferential attachment are both reasonable first-approximation assumptions to describe interaction networks in online communities. Our main hypothesis is that managed online communities are characterised by in-degree distributions that deviate from the power law form; such deviation constitutes the signature of successful community management. Our secondary hypothesis is that said deviation happens in a predictable way, once community management practices are accounted for. If true, these hypotheses would give us a simple test for the effectiveness of community management practices. We investigate the issue using (1) empirical data on three small online communities and (2) a computer model that simulates a widely used community management activity called onboarding . We find that onboarding produces in-degree distributions that systematically deviate from power law behaviour for low-values of the in-degree; we then explore the implications and possible applications of the finding.
The unusual rainbow trout sex determination gene hijacked the canonical vertebrate gonadal differentiation pathway
Evolutionary novelties require rewiring of transcriptional networks and/or the evolution of new gene functions. Sex determination (SD), one of the most plastic evolutionary processes, requires such novelties. Studies on the evolution of vertebrate SD revealed that new master SD genes are generally recruited from genes involved in the downstream SD regulatory genetic network. Only a single exception to this rule is currently known in vertebrates: the intriguing case of the salmonid master SD gene (sdY), which arose from duplication of an immune-related gene. This exception immediately posed the question of how a gene outside from the classical sex differentiation cascade could acquire its function as a male SD gene. Here we show that SdY became integrated in the classical vertebrate sex differentiation cascade by interacting with the Forkhead box domain of the female-determining transcription factor, Foxl2. In the presence of Foxl2, SdY is translocated to the nucleus where the SdY:Foxl2 complex prevents activation of the aromatase (cyp19a1a) promoter in cooperation with Nr5a1 (Sf1). Hence, by blocking a positive loop of regulation needed for the synthesis of estrogens in the early differentiating gonad, SdY disrupts a preset female differentiation pathway, consequently allowing testicular differentiation to proceed. These results also suggest that the evolution of unusual vertebrate master sex determination genes recruited from outside the classical pathway like sdY is strongly constrained by their ability to interact with the canonical gonadal differentiation pathway.