Algorithm selection using edge ML and case-based reasoning

In practical data mining, a wide range of classification algorithms is employed for prediction tasks. However, selecting the best algorithm poses a challenging task for machine learning practitioners and experts, primarily due to the inherent variability in the characteristics of classification problems, referred to as datasets, and the unpredictable performance of these algorithms. Dataset characteristics are quantified in terms of meta-features, while classifier performance is evaluated using various performance metrics. The assessment of classifiers through empirical methods across multiple classification datasets, while considering multiple performance metrics, presents a computationally expensive and time-consuming obstacle in the pursuit of selecting the optimal algorithm. Furthermore, the scarcity of sufficient training data, denoted by dimensions representing the number of datasets and the feature space described by meta-feature perspectives, adds further complexity to the process of algorithm selection using classical machine learning methods. This research paper presents an integrated framework called eML-CBR that combines edge edge-ML and case-based reasoning methodologies to accurately address the algorithm selection problem. It adapts a multi-level, multi-view case-based reasoning methodology, considering data from diverse feature dimensions and the algorithms from multiple performance aspects, that distributes computations to both cloud edges and centralized nodes. On the edge, the first-level reasoning employs machine learning methods to recommend a family of classification algorithms, while at the second level, it recommends a list of the top-k algorithms within that family. This list is further refined by an algorithm conflict resolver module. The eML-CBR framework offers a suite of contributions, including integrated algorithm selection, multi-view meta-feature extraction, innovative performance criteria, improved algorithm recommendation, data scarcity mitigation through incremental learning, and an open-source CBR module, reshaping research paradigms. The CBR module, trained on 100 datasets and tested with 52 datasets using 9 decision tree algorithms, achieved an accuracy of 94% for correct classifier recommendations within the top k=3 algorithms, making it highly suitable for practical classification applications

Semantic-driven matchmaking of web services using case-based reasoning

With the rapid proliferation of Web services as the medium of choice to securely publish application services beyond the firewall, the importance of accurate, yet flexible matchmaking of similar services gains importance both for the human user and for dynamic composition engines. In this paper, we present a novel approach that utilizes the case based reasoning methodology for modelling dynamic Web service discovery and matchmaking. Our framework considers Web services execution experiences in the decision making process and is highly adaptable to the service requester constraints. The framework also utilises OWL semantic descriptions extensively for implementing both the components of the CBR engine and the matchmaking profile of the Web services

Human Perceptions of Fairness in Algorithmic Decision Making: A Case Study of Criminal Risk Prediction

As algorithms are increasingly used to make important decisions that affect human lives, ranging from social benefit assignment to predicting risk of criminal recidivism, concerns have been raised about the fairness of algorithmic decision making. Most prior works on algorithmic fairness normatively prescribe how fair decisions ought to be made. In contrast, here, we descriptively survey users for how they perceive and reason about fairness in algorithmic decision making. A key contribution of this work is the framework we propose to understand why people perceive certain features as fair or unfair to be used in algorithms. Our framework identifies eight properties of features, such as relevance, volitionality and reliability, as latent considerations that inform people's moral judgments about the fairness of feature use in decision-making algorithms. We validate our framework through a series of scenario-based surveys with 576 people. We find that, based on a person's assessment of the eight latent properties of a feature in our exemplar scenario, we can accurately (> 85%) predict if the person will judge the use of the feature as fair. Our findings have important implications. At a high-level, we show that people's unfairness concerns are multi-dimensional and argue that future studies need to address unfairness concerns beyond discrimination. At a low-level, we find considerable disagreements in people's fairness judgments. We identify root causes of the disagreements, and note possible pathways to resolve them.Comment: To appear in the Proceedings of the Web Conference (WWW 2018). Code available at https://fate-computing.mpi-sws.org/procedural_fairness

Secondary predication in Russian

The paper makes two contributions to semantic typology of secondary predicates. It provides an explanation of the fact that Russian has no resultative secondary predicates, relating this explanation to the interpretation of secondary predicates in English. And it relates depictive secondary predicates in Russian, which usually occur in the instrumental case, to other uses of the instrumental case in Russian, establishing here, too, a difference to English concerning the scope of the secondary predication phenomenon

Simulated cognitive topologies: automatically generating highly contextual maps for complex journeys

As people traverse complex journeys, they engage in a number of information interactions across spatial scales and levels of abstraction. Journey complexity is characterised by factors including the number of actions required, and by variation in the contextual basis of reasoning such as a transition between different modes of transport. The high-level task of an A to B journey decomposes into a sequence of lower-level navigational sub-tasks, with the representation of geographic entities that support navigation during, between and across sub-tasks, varying relative to the nature of the task and the character of the geography. For example, transitioning from or to a particular mode of transport has a direct bearing on the natural level of representational abstraction that supports the task, as well as on the overall extent of the task’s region of influence on the traveller’s focus. Modern mobile technologies send data to a device that can in theory be context-specific in terms of explicitly reflecting a traveller’s heterogeneous information requirements, however the extent to which context is explicitly reflected in the selection and display of navigational information remains limited in practice, with a rigid, predetermined scale-based hierarchy of cartographic views remaining the underlying representational paradigm. The core subject of the research is the context-dependent selection and display of navigational information, and while there are many and varied considerations in developing techniques to address selection and display, the central challenge can simply be articulated as how to determine the probability, given the traveller’s current context, that a feature should be in the current map view. Clearly this central challenge extends to all features in the spatial extent, and so from a practical perspective, research questions centre around the initial selection of a subset of features, and around determining an overall probability distribution over the subset given the significance of features within the hierarchically ordered sequence of tasks. In this thesis research is presented around the use of graph structures as a practical basis for modeling urban geography to support heterogenous selections across viewing scales, and ultimately for displaying highly context-specific cartographic views. Through an iterative, empirical research methodology, a formalised approach based on routing networks is presented, which serves as the basis for modeling, selection and display. Findings are presented from a series of 7 situated navigation studies that included research with an existing navigation application as well as experimental research stimuli. Hypotheses were validated and refined over the course of the studies, with a focus on journey-specific regions that form around the navigable network. Empirical data includes sketch maps, textual descriptions, video and device interactions over the course of complex navigation exercises. Study findings support the proposed graph architecture, including subgraph classes that approximate cognitive structures central to natural comprehension and reasoning. Empirical findings lead to the central argument of a model based on causal mechanisms, in which relations are formalised between task, selection and abstraction. A causal framework for automatically determining map content for a given journey context is presented, with the approach involving a conceptual shift from treating geographic features as spatially indexed records, to treating them as variables with a finite number of possible states. Causal nets serve as the practical basis of reasoning, with geographic features being represented by variables in these causal structures. The central challenge of finding the probability that a variable in a causal net is in a particular state is addressed through a causal model in which journey context serves as the evidence that propagates over the net. In this way, complex heterogeneous selections for interactive multi-scale information spaces are expressed as probability distributions determined through message propagation. The thesis concludes with a discussion around the implications of the approach for the presentation of navigational information, and it is shown how the framework can support context-specific selection and disambiguation of map content, demonstrated through the central use case of navigating complex urban journeys