In the Land of the Blind, the One-Eyed Man Is King: Knowledge Brokerage in the Age of Learning Algorithms

2021 ◽  
Author(s):  
Lauren Waardenburg ◽  
Marleen Huysman ◽  
Anastasia V. Sergeeva
Keyword(s):  
Machine Learning ◽  
Learning Community ◽  
Learning Algorithm ◽  
Learning Algorithms ◽  
Ethnographic Study ◽  
Police Management ◽  
Knowledge Brokerage ◽  
Knowledge Brokers ◽  
The One ◽  
Over Time

This paper presents research on how knowledge brokers attempt to translate opaque algorithmic predictions. The research is based on a 31-month ethnographic study of the implementation of a learning algorithm by the Dutch police to predict the occurrence of crime incidents and offers one of the first empirical accounts of algorithmic brokers. We studied a group of intelligence officers, who were tasked with brokering between a machine learning community and a user community by translating the outcomes of the learning algorithm to police management. We found that, as knowledge brokers, they performed different translation practices over time and enacted increasingly influential brokerage roles, namely, those of messenger, interpreter, and curator. Triggered by an impassable knowledge boundary yielded by the black-boxed machine learning, the brokers eventually acted like “kings in the land of the blind” and substituted the algorithmic predictions with their own judgments. By emphasizing the dynamic and influential nature of algorithmic brokerage work, we contribute to the literature on knowledge brokerage and translation in the age of learning algorithms.

Inconsistency-Induced Learning for Perpetual Learners

2013 ◽  
pp. 70-87 ◽  
Author(s):  
Du Zhang ◽  
Meiliu Lu
Keyword(s):  
Machine Learning ◽  
Learning Algorithm ◽  
Target Function ◽  
Data Sets ◽  
Revision Process ◽  
Learning Agents ◽  
Learning Agent ◽  
The One ◽  
Over Time

One of the long-term research goals in machine learning is how to build never-ending learners. The state-of-the-practice in the field of machine learning thus far is still dominated by the one-time learner paradigm: some learning algorithm is utilized on data sets to produce certain model or target function, and then the learner is put away and the model or function is put to work. Such a learn-once-apply-next (or LOAN) approach may not be adequate in dealing with many real world problems and is in sharp contrast with the human’s lifelong learning process. On the other hand, learning can often be brought on through overcoming some inconsistent circumstances. This paper proposes a framework for perpetual learning agents that are capable of continuously refining or augmenting their knowledge through overcoming inconsistencies encountered during their problem-solving episodes. The never-ending nature of a perpetual learning agent is embodied in the framework as the agent’s continuous inconsistency-induced belief revision process. The framework hinges on the agents recognizing inconsistency in data, information, knowledge, or meta-knowledge, identifying the cause of inconsistency, revising or augmenting beliefs to explain, resolve, or accommodate inconsistency. The authors believe that inconsistency can serve as one of the important learning stimuli toward building perpetual learning agents that incrementally improve their performance over time.

Adaptive Learning Algorithm Convergence in Passive and Reactive Environments

2018 ◽  
Vol 30 (10) ◽  
pp. 2805-2832 ◽  
Author(s):  
Richard M. Golden
Keyword(s):  
Machine Learning ◽  
Learning Community ◽  
Stochastic Approximation ◽  
Approximation Theory ◽  
Adaptive Learning ◽  
Learning Algorithm ◽  
Learning Algorithms ◽  
Evaluation Process ◽  
Machine Learning Algorithms ◽  
Analysis And Design

Although the number of artificial neural network and machine learning architectures is growing at an exponential pace, more attention needs to be paid to theoretical guarantees of asymptotic convergence for novel, nonlinear, high-dimensional adaptive learning algorithms. When properly understood, such guarantees can guide the algorithm development and evaluation process and provide theoretical validation for a particular algorithm design. For many decades, the machine learning community has widely recognized the importance of stochastic approximation theory as a powerful tool for identifying explicit convergence conditions for adaptive learning machines. However, the verification of such conditions is challenging for multidisciplinary researchers not working in the area of stochastic approximation theory. For this reason, this letter presents a new stochastic approximation theorem for both passive and reactive learning environments with assumptions that are easily verifiable. The theorem is widely applicable to the analysis and design of important machine learning algorithms including deep learning algorithms with multiple strict local minimizers, Monte Carlo expectation-maximization algorithms, contrastive divergence learning in Markov fields, and policy gradient reinforcement learning.

Intelligent system of English composition scoring model based on improved machine learning algorithm

2020 ◽  
pp. 1-11
Author(s):  
Jie Liu ◽  
Lin Lin ◽  
Xiufang Liang
Keyword(s):  
Machine Learning ◽  
Evaluation System ◽  
Intelligent System ◽  
Learning Algorithm ◽  
Learning Algorithms ◽  
Machine Learning Algorithms ◽  
Assessment System ◽  
English Composition ◽  
Region Extraction ◽  
Constraint Model

The online English teaching system has certain requirements for the intelligent scoring system, and the most difficult stage of intelligent scoring in the English test is to score the English composition through the intelligent model. In order to improve the intelligence of English composition scoring, based on machine learning algorithms, this study combines intelligent image recognition technology to improve machine learning algorithms, and proposes an improved MSER-based character candidate region extraction algorithm and a convolutional neural network-based pseudo-character region filtering algorithm. In addition, in order to verify whether the algorithm model proposed in this paper meets the requirements of the group text, that is, to verify the feasibility of the algorithm, the performance of the model proposed in this study is analyzed through design experiments. Moreover, the basic conditions for composition scoring are input into the model as a constraint model. The research results show that the algorithm proposed in this paper has a certain practical effect, and it can be applied to the English assessment system and the online assessment system of the homework evaluation system algorithm system.

A network case of knowledge brokering

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Joelle Rodway ◽  
Stephen MacGregor ◽  
Alan Daly ◽  
Yi-Hwa Liou ◽  
Susan Yonezawa ◽  
...  
Keyword(s):  
Social Network ◽  
Learning Community ◽  
Knowledge Exchange ◽  
Point Of View ◽  
Network Activity ◽  
Centrality Measures ◽  
Knowledge Brokering ◽  
Content Type ◽  
Knowledge Brokers ◽  
Over Time

PurposeThe purpose of this paper is two-fold: (1) to offer a conceptual understanding of knowledge brokering from a sociometric point-of-view; and (2) to provide an empirical example of this conceptualization in an education context.Design/methodology/approachWe use social network theory and analysis tools to explore knowledge exchange patterns among a group of teachers, instructional coaches and administrators who are collectively seeking to build increased capacity for effective mathematics instruction. We propose the concept of network activity to measure direct and indirect knowledge brokerage through the use of degree and betweenness centrality measures. Further, we propose network utility—measured by tie multiplexity—as a second key component of effective knowledge brokering.FindingsOur findings suggest significant increases in both direct and indirect knowledge brokering activity across the network over time. Teachers, in particular, emerge as key knowledge brokers within this networked learning community. Importantly, there is also an increase in the number of resources exchanged through network relationships over time; the most active knowledge brokers in this social ecosystem are those individuals who are exchanging multiple forms of knowledge.Originality/valueThis study focuses on knowledge brokering as it presents itself in the relational patterns among educators within a social ecosystem. While it could be that formal organizational roles may encapsulate knowledge brokering across physical structures with an education system (e.g. between schools and central offices), these individuals are not necessarily the people who are most effectively brokering knowledge across actors within the broader social network.

A Robust Method to Predict Fluid Properties Based on Big Data and Machine Learning Algorithms

2021 ◽  
Author(s):  
Yingxian Liu ◽  
Cunliang Chen ◽  
Hanqing Zhao ◽  
Yu Wang ◽  
Xiaodong Han
Keyword(s):  
Machine Learning ◽  
Physical Properties ◽  
Learning Algorithm ◽  
Direct Method ◽  
Learning Algorithms ◽  
Small Error ◽  
Machine Learning Algorithms ◽  
Well Test ◽  
Empirical Formulas ◽  
Fluid Properties

Abstract Fluid properties are key factors for predicting single well productivity, well test interpretation and oilfield recovery prediction, which directly affect the success of ODP program design. The most accurate and direct method of acquisition is underground sampling. However, not every well has samples due to technical reasons such as excessive well deviation or high cost during the exploration stage. Therefore, analogies or empirical formulas have to be adopted to carry out research in many cases. But a large number of oilfield developments have shown that the errors caused by these methods are very large. Therefore, how to quickly and accurately obtain fluid physical properties is of great significance. In recent years, with the development and improvement of artificial intelligence or machine learning algorithms, their applications in the oilfield have become more and more extensive. This paper proposed a method for predicting crude oil physical properties based on machine learning algorithms. This method uses PVT data from nearly 100 wells in Bohai Oilfield. 75% of the data is used for training and learning to obtain the prediction model, and the remaining 25% is used for testing. Practice shows that the prediction results of the machine learning algorithm are very close to the actual data, with a very small error. Finally, this method was used to apply the preliminary plan design of the BZ29 oilfield which is a new oilfield. Especially for the unsampled sand bodies, the fluid physical properties prediction was carried out. It also compares the influence of the analogy method on the scheme, which provides potential and risk analysis for scheme design. This method will be applied in more oil fields in the Bohai Sea in the future and has important promotion value.

Understanding knowledge brokerage and its transformative potential: a Bourdieusian perspective

2021 ◽  
Author(s):  
Sarah Chew ◽  
Natalie Armstrong ◽  
Graham P. Martin
Keyword(s):  
Qualitative Data ◽  
Healthcare Research ◽  
Ethnographic Study ◽  
Knowledge Brokering ◽  
Research And Practice ◽  
Documentary Sources ◽  
Transformative Potential ◽  
Knowledge Brokerage ◽  
Knowledge Brokers ◽  
Institutional Boundaries

Background: Knowledge brokering is promoted as a means of enabling exchange between fields and closer collaboration across institutional boundaries. Yet examples of its success in fostering collaboration and reconfiguring boundaries remain few.Aims and objectives: We consider the introduction of a dedicated knowledge-brokering role in a partnership across healthcare research and practice, with a view to examining the interaction between knowledge brokers’ location and attributes and the characteristics of the fields across which they work.Methods: We use qualitative data from a four-year ethnographic study, including observations, interviews, focus groups, reflective diaries and other documentary sources. Our analysis draws on Pierre Bourdieu’s conceptual framework.Findings: In efforts to transform the boundaries between related but disjointed fields, a feature posited as advantageous – knowledge brokers’ liminality – may in practice work to their disadvantage. An unequal partnership between two fields, where the capitals (the resources, relationships, markers of prestige and forms of knowledge) valued in one are privileged over the other, left knowledge brokers without a prior affiliation to either field adrift between the two.Discussion and conclusions: Lacking legitimacy to act across fields and bridge the gap between them, knowledge brokers are likely to seek to develop their skills on one side of the boundary, focusing on more limited and conservative activities, rather than advance the value of a distinctive array of capitals in mediating between fields. We identify implications for the construction and deployment of knowledge-brokering interventions towards collaborative objectives.<br />Key messages<br /><ul><li>Knowledge brokers are vaunted as a means of translating knowledge and removing barriers between fields;</li><br /><li>Their position ‘in between’ fields is important, but their influence in those fields may be limited;</li><br /><li>Lacking the resources and relationships to work across fields, they may align with only one;</li><br /><li>Both the structure of fields and the prior knowledge and habitus of brokers will influence knowledge brokerage’s success.</li></ul>

scholarly journals Incremental and Iterative Learning of Answer Set Programs from Mutually Distinct Examples

2018 ◽  
Vol 18 (3-4) ◽  
pp. 623-637 ◽  
Author(s):  
ARINDAM MITRA ◽  
CHITTA BARAL
Keyword(s):  
Machine Learning ◽  
Learning Community ◽  
Question Answering ◽  
Learning Algorithms ◽  
Inductive Logic ◽  
Opportunity To Learn ◽  
Machine Learning Algorithms ◽  
Knowledge Representation And Reasoning ◽  
Handwritten Digit ◽  
Answer Set

AbstractOver the years the Artificial Intelligence (AI) community has produced several datasets which have given the machine learning algorithms the opportunity to learn various skills across various domains. However, a subclass of these machine learning algorithms that aimed at learning logic programs, namely the Inductive Logic Programming algorithms, have often failed at the task due to the vastness of these datasets. This has impacted the usability of knowledge representation and reasoning techniques in the development of AI systems. In this research, we try to address this scalability issue for the algorithms that learn answer set programs. We present a sound and complete algorithm which takes the input in a slightly different manner and performs an efficient and more user controlled search for a solution. We show via experiments that our algorithm can learn from two popular datasets from machine learning community, namely bAbl (a question answering dataset) and MNIST (a dataset for handwritten digit recognition), which to the best of our knowledge was not previously possible. The system is publicly available athttps://goo.gl/KdWAcV.

scholarly journals Risk Monitoring and Quantitative Results of Various Attributes of Machine Learning Algorithms with a Time Series Data

2019 ◽  
Vol 8 (11) ◽  
pp. 4018-4022
Keyword(s):  
Machine Learning ◽  
Time Series Data ◽  
Learning Algorithm ◽  
Learning Algorithms ◽  
Machine Learning Algorithms ◽  
Series Data ◽  
Machine Learning Algorithm ◽  
Risk Modelling ◽  
Risk Monitoring ◽  
Quantitative Results

The aim of this research is to do risk modelling after analysis of twitter posts based on certain sentiment analysis. In this research we analyze posts of several users or a particular user to check whether they can be cause of concern to the society or not. Every sentiment like happy, sad, anger and other emotions are going to provide scaling of severity in the conclusion of final table on which machine learning algorithm is applied. The data which is put under the machine learning algorithms are been monitored over a period of time and it is related to a particular topic in an area

scholarly journals DETECTING CREDIT CARD FRAUD USING MACHINE LEARNING ALGORITHMS

InterConf ◽  
2021 ◽  
pp. 393-403
Author(s):  
Olexander Shmatko ◽  
Volodimir Fedorchenko ◽  
Dmytro Prochukhan
Keyword(s):  
Machine Learning ◽  
Financial Services ◽  
Credit Card ◽  
Banking Sector ◽  
Learning Algorithm ◽  
Learning Algorithms ◽  
Credit Cards ◽  
Internet Banking ◽  
Machine Learning Algorithms ◽  
Credit Card Fraud

Today the banking sector offers its clients many different financial services such as ATM cards, Internet banking, Debit card, and Credit card, which allows attracting a large number of new customers. This article proposes an information system for detecting credit card fraud using a machine learning algorithm. Usually, credit cards are used by the customer around the clock, so the bank's server can track all transactions using machine learning algorithms. It must find or predict fraud detection. The dataset contains characteristics for each transaction and fraudulent transactions need to be classified and detected. For these purposes, the work proposes the use of the Random Forest algorithm.

scholarly journals Significant Impact of Improved Machine Learning Algorithm in The Processes of Large Data Sets

2020 ◽  
pp. 458-467
Author(s):  
Virendra Tiwari ◽  
Balendra Garg ◽  
Uday Prakash Sharma
Keyword(s):  
Machine Learning ◽  
Learning Algorithm ◽  
Learning Algorithms ◽  
Dynamic Environment ◽  
Large Data ◽  
Machine Learning Algorithms ◽  
Streaming Data ◽  
Machine Learning Techniques ◽  
Machine Learning Algorithm ◽  
Learning Mechanisms

The machine learning algorithms are capable of managing multi-dimensional data under the dynamic environment. Despite its so many vital features, there are some challenges to overcome. The machine learning algorithms still requires some additional mechanisms or procedures for predicting a large number of new classes with managing privacy. The deficiencies show the reliable use of a machine learning algorithm relies on human experts because raw data may complicate the learning process which may generate inaccurate results. So the interpretation of outcomes with expertise in machine learning mechanisms is a significant challenge in the machine learning algorithm. The machine learning technique suffers from the issue of high dimensionality, adaptability, distributed computing, scalability, the streaming data, and the duplicity. The main issue of the machine learning algorithm is found its vulnerability to manage errors. Furthermore, machine learning techniques are also found to lack variability. This paper studies how can be reduced the computational complexity of machine learning algorithms by finding how to make predictions using an improved algorithm.

Sign in / Sign up

Export Citation Format

Share Document