Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Computer Sciences (650)
- Artificial Intelligence and Robotics (465)
- Engineering (124)
- Social and Behavioral Sciences (109)
- Arts and Humanities (64)
-
- Business (61)
- Computer Engineering (59)
- Medicine and Health Sciences (56)
- Law (53)
- Databases and Information Systems (49)
- Mathematics (43)
- Education (38)
- Theory and Algorithms (37)
- Electrical and Computer Engineering (35)
- Information Security (27)
- Public Affairs, Public Policy and Public Administration (27)
- Technology and Innovation (27)
- Science and Technology Law (23)
- Numerical Analysis and Scientific Computing (21)
- Data Science (20)
- Operations Research, Systems Engineering and Industrial Engineering (20)
- Psychology (19)
- Library and Information Science (18)
- Graphics and Human Computer Interfaces (16)
- Software Engineering (16)
- Art and Design (15)
- Communication (15)
- International and Area Studies (15)
- Asian Studies (14)
- Institution
-
- Singapore Management University (76)
- Lindenwood University (50)
- Old Dominion University (49)
- Air Force Institute of Technology (25)
- Indian Statistical Institute (23)
-
- Edith Cowan University (21)
- TÜBİTAK (13)
- Zayed University (13)
- Portland State University (12)
- Technological University Dublin (12)
- University of Denver (12)
- University of Texas Rio Grande Valley (12)
- University of Pennsylvania Carey Law School (11)
- City University of New York (CUNY) (10)
- MBZUAI (10)
- Selected Works (9)
- University of Kentucky (9)
- Brigham Young University (8)
- Claremont Colleges (8)
- Seattle Pacific University (8)
- University of Nebraska - Lincoln (8)
- California Polytechnic State University, San Luis Obispo (7)
- China Simulation Federation (7)
- Loyola University Chicago (7)
- University of Michigan Law School (7)
- Florida International University (6)
- New Jersey Institute of Technology (6)
- Nova Southeastern University (6)
- Thomas Jefferson University (6)
- University of Louisville (6)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (55)
- Faculty Scholarship (49)
- Theses and Dissertations (40)
- Doctoral Theses (23)
- Electronic Theses and Dissertations (22)
-
- Computer Science Faculty Publications (14)
- All Works (13)
- Articles (13)
- All Faculty Scholarship (11)
- Turkish Journal of Electrical Engineering and Computer Sciences (11)
- Dissertations (9)
- Computer Science Faculty Publications and Presentations (7)
- Computer Science: Faculty Publications and Other Works (7)
- Journal of System Simulation (7)
- Publications and Research (7)
- SPU Works (7)
- Browse all Theses and Dissertations (6)
- CCE Theses and Dissertations (6)
- Honors Theses (6)
- Research outputs 2022 to 2026 (6)
- Theses (6)
- Theses and Dissertations--Computer Science (6)
- VMASC Publications (6)
- Asian Management Insights (5)
- Branch Mathematics and Statistics Faculty and Staff Publications (5)
- Computer Vision Faculty Publications (5)
- Perspectives@SMU (5)
- Research Collection Yong Pung How School Of Law (5)
- Research outputs 2014 to 2021 (5)
- All Dissertations (4)
- Publication Type
- File Type
Articles 571 - 600 of 704
Full-Text Articles in Physical Sciences and Mathematics
Using Topic Modelling Algorithms For Hierarchical Activity Discovery, Eoin Rogers, John D. Kelleher, Robert J. Ross
Using Topic Modelling Algorithms For Hierarchical Activity Discovery, Eoin Rogers, John D. Kelleher, Robert J. Ross
Conference papers
Activity discovery is the unsupervised process of discovering patterns in data produced from sensor networks that are monitoring the behaviour of human subjects. Improvements in activity discovery may simplify the training of activity recognition models by enabling the automated annotation of datasets and also the construction of systems that can detect and highlight deviations from normal behaviour. With this in mind, we propose an approach to activity discovery based on topic modelling techniques, and evaluate it on a dataset that mimics complex, interleaved sensor data in the real world. We also propose a means for discovering hierarchies of aggregated activities …
Cp-Nets: From Theory To Practice, Thomas E. Allen
Cp-Nets: From Theory To Practice, Thomas E. Allen
Theses and Dissertations--Computer Science
Conditional preference networks (CP-nets) exploit the power of ceteris paribus rules to represent preferences over combinatorial decision domains compactly. CP-nets have much appeal. However, their study has not yet advanced sufficiently for their widespread use in real-world applications. Known algorithms for deciding dominance---whether one outcome is better than another with respect to a CP-net---require exponential time. Data for CP-nets are difficult to obtain: human subjects data over combinatorial domains are not readily available, and earlier work on random generation is also problematic. Also, much of the research on CP-nets makes strong, often unrealistic assumptions, such as that decision variables must …
Modeling, Learning And Reasoning About Preference Trees Over Combinatorial Domains, Xudong Liu
Modeling, Learning And Reasoning About Preference Trees Over Combinatorial Domains, Xudong Liu
Theses and Dissertations--Computer Science
In my Ph.D. dissertation, I have studied problems arising in various aspects of preferences: preference modeling, preference learning, and preference reasoning, when preferences concern outcomes ranging over combinatorial domains. Preferences is a major research component in artificial intelligence (AI) and decision theory, and is closely related to the social choice theory considered by economists and political scientists. In my dissertation, I have exploited emerging connections between preferences in AI and social choice theory. Most of my research is on qualitative preference representations that extend and combine existing formalisms such as conditional preference nets, lexicographic preference trees, answer-set optimization programs, possibilistic …
Online Arima Algorithms For Time Series Prediction, Chenghao Liu, Hoi, Steven C. H., Peilin Zhao, Jianling Sun
Online Arima Algorithms For Time Series Prediction, Chenghao Liu, Hoi, Steven C. H., Peilin Zhao, Jianling Sun
Research Collection School Of Computing and Information Systems
Autoregressive integrated moving average (ARIMA) is one of the most popular linear models for time series forecasting due to its nice statistical properties and great flexibility. However, its parameters are estimated in a batch manner and its noise terms are often assumed to be strictly bounded, which restricts its applications and makes it inefficient for handling large-scale real data. In this paper, we propose online learning algorithms for estimating ARIMA models under relaxed assumptions on the noise terms, which is suitable to a wider range of applications and enjoys high computational efficiency. The idea of our ARIMA method is to …
Automated Conjecturing Approach For Benzenoids, David Muncy
Automated Conjecturing Approach For Benzenoids, David Muncy
Theses and Dissertations
Benzenoids are graphs representing the carbon structure of molecules, defined by a closed path in the hexagonal lattice. These compounds are of interest to chemists studying existing and potential carbon structures. The goal of this study is to conjecture and prove relations between graph theoretic properties among benzenoids. First, we generate conjectures on upper bounds for the domination number in benzenoids using invariant-defined functions. This work is an extension of the ideas to be presented in a forthcoming paper. Next, we generate conjectures using property-defined functions. As the title indicates, the conjectures we prove are not thought of on our …
Pure Fuzzy Hall Effect Sensors For Permanent Magnet Synchronous Motor, İbrahi̇m Alişkan, Rüstem Yilmazel
Pure Fuzzy Hall Effect Sensors For Permanent Magnet Synchronous Motor, İbrahi̇m Alişkan, Rüstem Yilmazel
Turkish Journal of Electrical Engineering and Computer Sciences
An investigation about Hall effect sensors' efficiency is confirmed in permanent magnet synchronous motor (PMSM) drive systems. A fuzzy control algorithm is used as an artificial intelligence controller. Large scale and low slopes are used for creating membership functions and a sensitive controller is obtained. Speed is wanted to be taken under control and a minimum error value is aimed. PMSM drive systems are established using MATLAB-Simulink/SimPower. Simulations are realized with real-time parameters in discrete mode. A fuzzy logic controller is designed by using the MATLAB/Fuzzy Logic Toolbox. A normalization technique and high resolution output of the fuzzy logic controller …
Rapture Of The Geeks, Derek Schuurman
Rapture Of The Geeks, Derek Schuurman
Faculty Work Comprehensive List
"If we are more than machines, what is it that defines our humanity? Is it our intelligence, creativity, or emotion?"
Posting about the distinction between humans and artificial creatures from In All Things - an online hub committed to the claim that the life, death, and resurrection of Jesus Christ has implications for the entire world.
http://inallthings.org/the-rapture-of-the-geeks/
The Effectiveness Of Using A Modified “Beat Frequent Pick” Algorithm In The First International Roshambo Tournament, Proceso L. Fernandez Jr, Sony E. Valdez, Generino P. Siddayao
The Effectiveness Of Using A Modified “Beat Frequent Pick” Algorithm In The First International Roshambo Tournament, Proceso L. Fernandez Jr, Sony E. Valdez, Generino P. Siddayao
Department of Information Systems & Computer Science Faculty Publications
In this study, a bot is developed to compete in the first International RoShamBo Tournament test suite. The basic “Beat Frequent Pick (BFP)” algorithm was taken from the supplied test suite and was improved by adding a random choice tailored fit against the opponent's distribution of picks. A training program was also developed that finds the best performing bot variant by changing the bot's behavior in terms of the timing of the recomputation of the pick distribution. Simulation results demonstrate the significantly improved performance of the proposed variant over the original BFP. This indicates the potential of using the core …
On Supervised And Unsupervised Methodologies For Mining Of Text Data., Tanmay Basu Dr.
On Supervised And Unsupervised Methodologies For Mining Of Text Data., Tanmay Basu Dr.
Doctoral Theses
The supervised and unsupervised methodologies of text mining using the plain text data of English language have been discussed. Some new supervised and unsupervised methodologies have been developed for effective mining of the text data after successfully overcoming some limitations of the existing techniques.The problems of unsupervised techniques of text mining, i.e., document clustering methods are addressed. A new similarity measure between documents has been designed to improve the accuracy of measuring the content similarity between documents. Further, a hierarchical document clustering technique is designed using this similarity measure. The main significance of the clustering algorithm is that the number …
Using Monte Carlo Tree Search For Replanning In A Multistage Simultaneous Game, Daniel Beard, Philip Hingston, Martin Masek
Using Monte Carlo Tree Search For Replanning In A Multistage Simultaneous Game, Daniel Beard, Philip Hingston, Martin Masek
Martin Masek
In this study, we introduce MC-TSAR, a Monte Carlo Tree Search algorithm for strategy selection in simultaneous multistage games. We evaluate the algorithm using a battle planning scenario in which replanning is possible. We show that the algorithm can be used to select a strategy that approximates a Nash equilibrium strategy, taking into account the possibility of switching strategies part way through the execution of the scenario in the light of new information on the progress of the battle.
A Multimodal Problem For Competitive Coevolution, Philip Hingston, Tirtha Ranjeet, Chiou Peng Lam, Martin Masek
A Multimodal Problem For Competitive Coevolution, Philip Hingston, Tirtha Ranjeet, Chiou Peng Lam, Martin Masek
Martin Masek
Coevolutionary algorithms are a special kind of evolutionary algorithm with advantages in solving certain specific kinds of problems. In particular, competitive coevolutionary algorithms can be used to study problems in which two sides compete against each other and must choose a suitable strategy. Often these problems are multimodal - there is more than one strong strategy for each side. In this paper, we introduce a scalable multimodal test problem for competitive coevolution, and use it to investigate the effectiveness of some common coevolutionary algorithm enhancement techniques.
Probabilistic Inference Based Message-Passing For Resource Constrained Dcops, Supriyo Ghosh, Akshat Kumar, Pradeep Varakantham
Probabilistic Inference Based Message-Passing For Resource Constrained Dcops, Supriyo Ghosh, Akshat Kumar, Pradeep Varakantham
Research Collection School Of Computing and Information Systems
Distributed constraint optimization (DCOP) is an important framework for coordinated multiagent decision making. We address a practically useful variant of DCOP, called resource-constrained DCOP (RC-DCOP), which takes into account agents’ consumption of shared limited resources. We present a promising new class of algorithm for RC-DCOPs by translating the underlying co- ordination problem to probabilistic inference. Using inference techniques such as expectation- maximization and convex optimization machinery, we develop a novel convergent message-passing algorithm for RC-DCOPs. Experiments on standard benchmarks show that our approach provides better quality than previous best DCOP algorithms and has much lower failure rate. Comparisons against an …
Message Passing For Collective Graphical Models, Tao Sun, Daniel Sheldon, Akshat Kumar
Message Passing For Collective Graphical Models, Tao Sun, Daniel Sheldon, Akshat Kumar
Research Collection School Of Computing and Information Systems
Collective graphical models (CGMs) are a formalism for inference and learning about a population of independent and identically distributed individuals when only noisy aggregate data are available. We highlight a close connection between approximate MAP inference in CGMs and marginal inference in standard graphical models. The connection leads us to derive a novel Belief Propagation (BP) style algorithm for collective graphical models. Mathematically, the algorithm is a strict generalization of BP—it can be viewed as an extension to minimize the Bethe free energy plus additional energy terms that are non-linear functions of the marginals. For CGMs, the algorithm is much …
Continuous Monitoring Of Enterprise Risks: A Delphi Feasibility Study, Robert Baksa
Continuous Monitoring Of Enterprise Risks: A Delphi Feasibility Study, Robert Baksa
Dissertations
A constantly evolving regulatory environment, increasing market pressure to improve operations, and rapidly changing business conditions are creating the need for ongoing assurance that organizational risks are continually and adequately mitigated. Enterprises are perpetually exposed to fraud, poor decision making and/or other inefficiencies that can lead to significant financial loss and/or increased levels of operating risk. Increasingly, Information Systems are being harnessed to reinvent the risk management process. One promising technology is Continuous Auditing, which seeks to transform the audit process from periodic reviews of a few transactions to a continuous review of all transactions. However, the highly integrated, rapidly …
Estimating The Accuracy Of Automated Classification Systems Using Only Expert Ratings That Are Less Accurate Than The System, Paul E. Lehner
Estimating The Accuracy Of Automated Classification Systems Using Only Expert Ratings That Are Less Accurate Than The System, Paul E. Lehner
Journal of Modern Applied Statistical Methods
A method is presented to estimate the accuracy of an automated classification system based only on expert ratings on test cases, where the system may be substantially more accurate than the raters. In this method an estimate of overall rater accuracy is derived from the level of inter-rater agreement, Bayesian updating based on estimated rater accuracy is applied to estimate a ground truth probability for each classification on each test case, and then overall system accuracy is estimated by comparing the relative frequency that the system agrees with the most probable classification at different probability levels. A simulation analysis provides …
An Approach To Artificial Society Generation For Video Games, Bryan Sarlo
An Approach To Artificial Society Generation For Video Games, Bryan Sarlo
Electronic Thesis and Dissertation Repository
Since their inception in the 1940s, video games have always had a need for non-player characters (NPCs) driven by some form of artificial intelligence (AI). More recently, researchers and developers have attempted to create believable, or human-like, agents by modeling them after humans by borrowing concepts from the social sciences. This thesis explores an approach to generating a society of such believable agents with human-like attributes and social connections. This approach allows agents to form various kinds of relationships with other agents in the society, and even provides an introductory form of shared or influenced attributes based on their spouse …
Unified Behavior Framework For Discrete Event Simulation Systems, Alexander J. Kamrud
Unified Behavior Framework For Discrete Event Simulation Systems, Alexander J. Kamrud
Theses and Dissertations
Intelligent agents provide simulations a means to add lifelike behavior in place of manned entities. Generally when developed, a single intelligent agent model is chosen, such as rule based, behavior trees, etc. This choice introduces restrictions into what behaviors agents can manifest, and can require significant testing in edge cases. This thesis presents the use of the UBF in the AFSIM environment. The UBF provides the flexibility to implement any and all intelligent agent models, allowing the developer to choose the model he/she feels best fits the experiment at hand. Furthermore, the UBF demonstrates several key software engineering principles through …
Autonomous Quadcopter Videographer, Quiquia Rey Coaguila
Autonomous Quadcopter Videographer, Quiquia Rey Coaguila
Electronic Theses and Dissertations
In recent years, the interest in quadcopters as a robotics platform for autonomous photography has increased. This is due to their small size and mobility, which allow them to reach places that are difficult or even impossible for humans. This thesis focuses on the design of an autonomous quadcopter videographer, i.e. a quadcopter capable of capturing good footage of a specific subject. In order to obtain this footage, the system needs to choose appropriate vantage points and control the quadcopter. Skilled human videographers can easily spot good filming locations where the subject and its actions can be seen clearly in …
Modeling User Transportation Patterns Using Mobile Devices, Erfan Davami
Modeling User Transportation Patterns Using Mobile Devices, Erfan Davami
Electronic Theses and Dissertations
Participatory sensing frameworks use humans and their computing devices as a large mobile sensing network. Dramatic accessibility and affordability have turned mobile devices (smartphone and tablet computers) into the most popular computational machines in the world, exceeding laptops. By the end of 2013, more than 1.5 billion people on earth will have a smartphone. Increased coverage and higher speeds of cellular networks have given these devices the power to constantly stream large amounts of data. Most mobile devices are equipped with advanced sensors such as GPS, cameras, and microphones. This expansion of smartphone numbers and power has created a sensing …
Designing A Portfolio Of Parameter Configurations For Online Algorithm Selection, Aldy Gunawan, Hoong Chuin Lau, Mustafa Misir
Designing A Portfolio Of Parameter Configurations For Online Algorithm Selection, Aldy Gunawan, Hoong Chuin Lau, Mustafa Misir
Research Collection School Of Computing and Information Systems
Algorithm portfolios seek to determine an effective set of algorithms that can be used within an algorithm selection framework to solve problems. A limited number of these portfolio studies focus on generating different versions of a target algorithm using different parameter configurations. In this paper, we employ a Design of Experiments (DOE) approach to determine a promising range of values for each parameter of an algorithm. These ranges are further processed to determine a portfolio of parameter configurations, which would be used within two online Algorithm Selection approaches for solving different instances of a given combinatorial optimization problem effectively. We …
Semi-Universal Portfolios With Transaction Costs, Dingjiang Huang, Yan Zhu, Bin Li, Shuigeng Zhou, Steven C. H. Hoi
Semi-Universal Portfolios With Transaction Costs, Dingjiang Huang, Yan Zhu, Bin Li, Shuigeng Zhou, Steven C. H. Hoi
Research Collection School Of Computing and Information Systems
Online portfolio selection (PS) has been extensively studied in artificial intelligence and machine learning communities in recent years. An important practical issue of online PS is transaction cost, which is unavoidable and nontrivial in real financial trading markets. Most existing strategies, such as universal portfolio (UP) based strategies, often rebalance their target portfolio vectors at every investment period, and thus the total transaction cost increases rapidly and the final cumulative wealth degrades severely. To overcome the limitation, in this paper we investigate new investment strategies that rebalances its portfolio only at some selected instants. Specifically, we design a novel on-line …
A Theory Of Name Resolution, Pierre Néron, Andrew Tolmach, Eelco Visser, Guido Wachsmuth
A Theory Of Name Resolution, Pierre Néron, Andrew Tolmach, Eelco Visser, Guido Wachsmuth
Computer Science Faculty Publications and Presentations
We describe a language-independent theory for name binding and resolution, suitable for programming languages with complex scoping rules including both lexical scoping and modules. We formulate name resolution as a two-stage problem. First a language-independent scope graph is constructed using language-specific rules from an abstract syntax tree. Then references in the scope graph are resolved to corresponding declarations using a language-independent resolution process. We introduce a resolution calculus as a concise, declarative, and language- independent specification of name resolution. We develop a resolution algorithm that is sound and complete with respect to the calculus. Based on the resolution calculus we …
Sparse Coding Based Dense Feature Representation Model For Hyperspectral Image Classification, Ender Oguslu, Guoqing Zhou, Zezhong Zheng, Khan Iftekharuddin, Jiang Li
Sparse Coding Based Dense Feature Representation Model For Hyperspectral Image Classification, Ender Oguslu, Guoqing Zhou, Zezhong Zheng, Khan Iftekharuddin, Jiang Li
Electrical & Computer Engineering Faculty Publications
We present a sparse coding based dense feature representation model (a preliminary version of the paper was presented at the SPIE Remote Sensing Conference, Dresden, Germany, 2013) for hyperspectral image (HSI) classification. The proposed method learns a new representation for each pixel in HSI through the following four steps: sub-band construction, dictionary learning, encoding, and feature selection. The new representation usually has a very high dimensionality requiring a large amount of computational resources. We applied the l1/lq regularized multiclass logistic regression technique to reduce the size of the new representation. We integrated the method with a linear …
An Automatic Dialog System For Student Advising, Brian Mcmahan
An Automatic Dialog System For Student Advising, Brian Mcmahan
Journal of Undergraduate Research at Minnesota State University, Mankato
Automatic dialog systems are an implementation of natural language processing theory with the goal of allowing the use of natural sentences to communicate with a computer system. The general purpose of this project was to design and implement an automatic dialog system for augmenting university student advising. Student advising is a relatively narrow domain of possible questions and responses. The automatic dialog system focused on prescriptive advising rather than developmental advising to further narrow the domain to scheduling and registration matters. A student advisor was interviewed and recorded during a mock advising session in order to model the interaction between …
Convergence Of A Reinforcement Learning Algorithm In Continuous Domains, Stephen Carden
Convergence Of A Reinforcement Learning Algorithm In Continuous Domains, Stephen Carden
All Dissertations
In the field of Reinforcement Learning, Markov Decision Processes with a finite number of states and actions have been well studied, and there exist algorithms capable of producing a sequence of policies which converge to an optimal policy with probability one. Convergence guarantees for problems with continuous states also exist. Until recently, no online algorithm for continuous states and continuous actions has been proven to produce optimal policies. This Dissertation contains the results of research into reinforcement learning algorithms for problems in which both the state and action spaces are continuous. The problems to be solved are introduced formally as …
Collaborative Online Multitask Learning, Guangxia Li, Steven C. H. Hoi, Kuiyu Chang, Wenting Liu, Ramesh Jain
Collaborative Online Multitask Learning, Guangxia Li, Steven C. H. Hoi, Kuiyu Chang, Wenting Liu, Ramesh Jain
Research Collection School Of Computing and Information Systems
We study the problem of online multitask learning for solving multiple related classification tasks in parallel, aiming at classifying every sequence of data received by each task accurately and efficiently. One practical example of online multitask learning is the micro-blog sentiment detection on a group of users, which classifies micro-blog posts generated by each user into emotional or non-emotional categories. This particular online learning task is challenging for a number of reasons. First of all, to meet the critical requirements of online applications, a highly efficient and scalable classification solution that can make immediate predictions with low learning cost is …
A Continuous Learning Strategy For Self-Organizing Maps Based On Convergence Windows, Gregory T. Breard
A Continuous Learning Strategy For Self-Organizing Maps Based On Convergence Windows, Gregory T. Breard
Senior Honors Projects
A self-organizing map (SOM) is a type of artificial neural network that has applications in a variety of fields and disciplines. The SOM algorithm uses unsupervised learning to produce a low-dimensional representation of high- dimensional data. This is done by 'fitting' a grid of nodes to a data set over a fixed number of iterations. With each iteration, the nodes of the map are adjusted so that they appear more like the data points. The low-dimensionality of the resulting map means that it can be presented graphically and be more intuitively interpreted by humans. However, it is still essential to …
Evolutionary Algorithm Based Approach For Modeling Autonomously Trading Agents, Anil Yaman, Stephen Lucci, Izidor Gertner
Evolutionary Algorithm Based Approach For Modeling Autonomously Trading Agents, Anil Yaman, Stephen Lucci, Izidor Gertner
Publications and Research
The autonomously trading agents described in this paper produce a decision to act such as: buy, sell or hold, based on the input data. In this work, we have simulated autonomously trading agents using the Echo State Network (ESNs) model. We generate a collection of trading agents that use different trading strategies using Evolutionary Programming (EP). The agents are tested on EUR/ USD real market data. The main goal of this study is to test the overall performance of this collection of agents when they are active simultaneously. Simulation results show that using different agents concurrently outperform a single agent …
Adapting In-Game Agent Behavior By Observation Of Players Using Learning Behavior Trees, Emmett Tomai, Roberto Flores
Adapting In-Game Agent Behavior By Observation Of Players Using Learning Behavior Trees, Emmett Tomai, Roberto Flores
Computer Science Faculty Publications and Presentations
In this paper we describe Learning Behavior Trees, an extension of the popular game AI scripting technique. Behavior Trees provide an effective way for expert designers to describe complex, in-game agent behaviors. Scripted AI captures human intuition about the structure of behavioral decisions, but suffers from brittleness and lack of the natural variation seen in human players. Learning Behavior Trees are designed by a human designer, but then are trained by observation of players performing the same role, to introduce human-like variation to the decision structure. We show that, using this model, a single hand-designed Behavior Tree can cover a …
Slaves To Big Data. Or Are We?, Mireille Hildebrandt
Slaves To Big Data. Or Are We?, Mireille Hildebrandt
Mireille Hildebrandt
In this contribution the notion of Big Data is discussed in relation to the monetisation of personal data. The claim of some proponents as well as adversaries, that Big Data implies that ‘n = all’, meaning that we no longer need to rely on samples because we have all the data, is scrutinized and found both overly optimistic and unnecessarily pessimistic. A set of epistemological and ethical issues is presented, focusing on the implications of Big Data for our perception, cognition, fairness, privacy and due process. The article then looks into the idea of user centric personal data management, to …