Learning by Connecting: How Rule Networks Evolve Through Discovery of Relevance

2022 | Organization Science | Citations: 0

Authors: Schulz, Martin; Zhu, Kejia

Abstract: Learning-by-connecting, the formation of connections between lessons, is a fairl ... Expand

Abstract: Learning-by-connecting, the formation of connections between lessons, is a fairly common phenomenon, but how does it evolve? We argue that learning-by-connecting unfolds as the relevance of lessons to other lessons is gradually discovered over time. The process of “relevance discovery” unfolds through a dynamic interplay between lessons and their context that provides opportunities to discover the relevance of lessons to other lessons. We develop a theoretical model in which the availability of these opportunities and their sorting in time drive the formation of connections. We explore and test our model in the context of organizational rules that we conceptualize, following rule-based learning theories, as repositories of lessons learned. Our empirical context is the formation of citation ties between clinical practice guidelines (CPGs), a type of organizational rules in healthcare, in a Canadian regional healthcare organization. We find that citation tie formation intensifies when opportunities to discover relevance become available. We also find that learning-by-connecting creates rule networks in which the formation of new ties slows down due to the sorting of opportunities in time. Our findings support our assumption that learning-by-connecting is shaped by relevance discovery. Our study extends models of rule-based learning and contributes to discussions on the formation of connections in contexts of dispersed learning and knowledge. Collapse

Topics: organization learning knowledge repository organizational memory anonymity spreadsheet

Methods: survival analysis statistical hypothesis test co-citation analysis archival research descriptive statistic

Theories: learning theory organizational theory theory of abduction institutional theory

Decision support system (DSS) use and decision performance: DSS motivation and its antecedents

2017 | Information & Management | Citations: 3

Authors: Chan, Siew H.; Song, Qian; Sarker, Saonee; Plumlee, R. David

Abstract: We developed an experimental decision support system (DSS) that enabled us to ma ... Expand

Abstract: We developed an experimental decision support system (DSS) that enabled us to manipulate DSS performance feedback and response time, measure task motivation and DSS motivation, track the usage of the DSS, and obtain essential information for assessing decision performance through conjoint analysis. The results suggest the mediating role of DSS use in the relationship between DSS motivation and decision performance. Further, DSS motivation is highest in the presence of high task motivation, more positive DSS performance feedback, and fast DSS response time. The findings have important implications for both DSS research and practice. Collapse

Topics: decision support system IT career information system use IT workforce usage intention

Methods: statistical hypothesis test experiment conjoint analysis SEM tool experimental task

Theories: expectancy theory of motivation theory of task technology fit

Machine assessment of neonatal facial expressions of acute pain

2007 | Decision Support Systems | Citations: 4

Authors: Brahnam, Sheryl; Chuang, Chao-Fa; Sexton, Randall S.; Shih, Frank Y.

Abstract: We propose that a machine assessment system of neonatal expressions of pain be d ... Expand

Abstract: We propose that a machine assessment system of neonatal expressions of pain be developed to assist clinicians in diagnosing pain. The facial expressions of 26 neonates (age 18–72h) were photographed experiencing the acute pain of a heel lance and three nonpain stressors. Four algorithms were evaluated on out-of-sample observations: PCA, LDA, SVMs and NNSOA. NNSOA provided the best classification rate of pain versus nonpain (90.20%), followed by SVM with linear kernel (82.35%). We believe these results indicate a high potential for developing a decision support system for diagnosing neonatal pain from images of neonatal facial displays. Collapse

Topics: decision support system Microsoft Windows operating system Visual Basic Fortran

Methods: support vector machine data transformation principal component analysis experiment computational algorithm

Service-based P2P overlay network for collaborative problem solving

2007 | Decision Support Systems | Citations: 0

Authors: Goel, Sanjay; Talya, Shashishekara S.; Sobolewski, Michael

Abstract: This paper describes a service-based P2P overlay network architecture to support ... Expand

Abstract: This paper describes a service-based P2P overlay network architecture to support a collaborative environment for solving complex business processes over the network. In the proposed architecture, autonomic service providers corresponding to various activities that occur in the processes reside on the overlay network and are discovered dynamically during the execution of the process. To consummate a specific process, a set of services that map into the business process are federated together and executed in a choreographed sequence. All services have standardized interfaces and this allows any service to be seamlessly replaced with another service without affecting the performance of the federation. The paper presents two cases of application of this architecture, namely, business-to-business collaboration in an engineering environment (General Electric) and multiparty financial transactions (mortgage). Collapse

Topics: business process management database system peer-to-peer model Gnutella Fortran

Methods: case study design process

MOPEN: A computational package for Linear Multiobjective and Goal Programming problems

2005 | Decision Support Systems | Citations: 1

Authors: Caballero, R.; Luque, M.; Molina, J.; Ruiz, F.

Abstract: MOPEN is a computational package designed as a global tool for Linear Multiobjec ... Expand

Abstract: MOPEN is a computational package designed as a global tool for Linear Multiobjective and Goal Programming problems with continuous and/or integer variables. The main existing techniques for these problems have been included in this package. That is, it is possible to generate or approximate the efficient set using Generating Methods, to obtain Compromise solutions or to use Goal Programming or reference Point approaches. As will be described, many advanced options have been implemented with every method. MOPEN has been implemented under a Windows environment; thus, it is easy to build and handle the data entry files and the result layout files. The behavior of MOPEN—in terms of CPU time used to solve large problems—can be considered as good; therefore, this package is a powerful tool to handle the previously mentioned problems. Collapse

Topics: Fortran

Methods: goal programming trade-off analysis method computational algorithm

Heterogeneous Agent Development: A Multi-Agent System for Testing Stock Trading Algorithms

2005 | Americas Conference on Information Systems | Citations: 0

Authors: Russell, Stephen; Yoon, Victoria

Abstract: Intelligent agents have often been used as a method for simulating an active equ ... Expand

Abstract: Intelligent agents have often been used as a method for simulating an active equity market environment. While agents have been used extensively in trading and market simulations, agents have not been used in a system that only evaluates trading algorithms. To accomplish the simulations, agents are developed in a single or proprietary programming language. The use of agents developed in Microsoft’s .Net framework and CLR provides flexibility, scalability, compatibility, and interoperability beyond traditional agent development environments. This paper presents a multi-agent system developed using native JAVA, VB.Net, C# and PHP, all in the .Net environment. The system will demonstrate its abilities by comparing two equity trading algorithms. Collapse

Topics: programming language conversational agent PHP financial information system enterprise architecture

Methods: computational algorithm simulation statistical hypothesis test paired t-test parametric test

Design of an interactive spell checker: optimizing the list of offered words

2003 | Decision Support Systems | Citations: 0

Authors: Garfinkel, Robert; Fernandez, Elena; Gopal, Ram

Abstract: Interactive spell checking is an instance of a general problem that is character ... Expand

Abstract: Interactive spell checking is an instance of a general problem that is characterized by doubt as to the correctness of an input, and the need to correct the input or offer a set of possible corrections. Our contention is that a well-defined model can provide a basis to improve the performance of spell checkers and other similar applications such as voice recognition, historical document searches, and data imputation among others. In this paper, we introduce a model designed to help the spell checkers within word processors place the correct word at, or near, the top of the list of offered words. A prototype spell checker (SP) is developed based on the model. It is tested on documents typed by subjects and found to be very accurate. Collapse

Topics: Fortran workstation electronic mail voice user interfaces usability

Methods: experiment design artifact computational algorithm statistical hypothesis test data imputation

Cognitive Support for Real-Time Dynamic Decision Making

2001 | Information Systems Research | Citations: 0

Authors: Lerch, F. Javier; Harter, Donald E.

Abstract: This research examines how decision makers manage their attentional resources wh ... Expand

Abstract: This research examines how decision makers manage their attentional resources when making a series of interdependent decisions in a real-time environment. Decision strategies for real-time dynamic tasks consist of two main overlapping cognitive activities: monitoring and control. Monitoring refers to decision makers' tracking of key system variables as they work toward arriving at a decision. Control refers to the decision maker's generation, evaluation, and selection of alternative actions. In real-time tasks, these two activities compete for the same attentional resources. The questions that motivate the two studies presented here are: (1) can decision making be improved by increasing individuals' attentional resources, thereby enhancing their ability to monitor the system, and (2) can decision making be improved by providing individuals with feedback and/or feedforward control support? Our findings show that some kinds of cognitive support degrade performance, rather than enhance it. These results indicate that providing support for real-time dynamic decision making may be very difficult, and that designing effective decision aids requires a detailed understanding of the underlying cognitive processes. Collapse

Topics: situational awareness decision making electronic surveillance systems design programming language

Methods: simulation experiment experimental group multivariate analysis of variance descriptive statistic

Lower Bounds for the Multiperiod Capacitated Minimal Spanning Tree with Node Outage Cost Design Problem

2000 | Americas Conference on Information Systems | Citations: 0

Authors: Kawatra, Rakesh

Abstract: The Multiperiod Capacitated Minimal Spanning Tree With Node Outage Costs (MCMSTW ... Expand

Abstract: The Multiperiod Capacitated Minimal Spanning Tree With Node Outage Costs (MCMSTWOC) Design problem consists of scheduling the installation of links in a communication network so as to connect a set of terminal nodes S = [2,3...N] to a central node (node 1) with minimal present value of costs. The cost of the network is the sum of link layout cost and node outage costs. The link capacities limit the number of terminal nodes sharing a link. Node outage cost associated with each terminal node is the economic cost incurred by the network user whenever the terminal node is disabled due to failure of a link. In the network some of the terminal nodes are active at the beginning of the planning horizon while others are activated over time. The problem is formulated as an integer-programming problem. A Lagrangian relaxation method is used to find a lower bound for the optimal objective function value. Subgradient optimization method is used to find good lower bounds. This lower bound can be used to estimate the quality of the solution given by a heuristic. Collapse

Topics: Fortran

Methods: optimization model experiment integer programming

On the Kim and Roush Voting Procedure

1999 | Group Decision and Negotiation | Citations: 0

Authors: Lepelley, Dominique; Valognes, Fabrice

Abstract: We study in this paper some features of a new voting rule recently proposed by K ... Expand

Abstract: We study in this paper some features of a new voting rule recently proposed by K.H. Kim and F.W. Roush. The (conjectural) optimality of this voting rule with respect to statistical manipulability by coalitions is discussed under two alternative probabilistic assumptions, namely the impartial culture condition (IC) and the impartial anonymous culture condition (IAC). We also analyze the ability of Kim and Roush procedure to fulfil the Condorcet conditions. Some representations of its Condorcet efficiency in three-alternative elections are obtained. Collapse

Topics: Fortran