DOCSLIB.ORG

COST-SENSITIVE DECISION TREE LEARNING USING a MULTI-ARMED BANDIT FRAMEWORK Susan Elaine LOMAX

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
COST-SENSITIVE DECISION TREE LEARNING USING a MULTI-ARMED BANDIT FRAMEWORK Susan Elaine LOMAX COST-SENSITIVE DECISION TREE LEARNING USING A MULTI-ARMED BANDIT FRAMEWORK Susan Elaine LOMAX SCHOOL OF COMPUTING, SCIENCE AND ENGINEERING, INFORMATICS RESEARCH CENTRE, COLLEGE OF SCIENCE AND TECHNOLOGY, UNIVERSITY OF SALFORD Submitted in Fulfilment of the Requirements of the Degree of Doctor of Philosophy, June 2013 CONTENTS ACKNOWLEDGEMENTS .................................................................................................................... v ABSTRACT ........................................................................................................................................... vi CHAPTER 1: INTRODUCTION ........................................................................................................... 1 1.1 The motivation for the research in this thesis ............................................................................... 1 1.2 Research methodology .................................................................................................................. 3 1.3 Research hypothesis, aims and objectives .................................................................................... 6 1.4 Outline of thesis ............................................................................................................................ 7 CHAPTER 2: BACKGROUND ............................................................................................................. 9 2.1 Decision tree learning ................................................................................................................... 9 2.2 Game Theory .............................................................................................................................. 12 CHAPTER 3: SURVEY OF EXISTING COST-SENSITIVE DECISION TREE ALGORITHMS ... 18 3.1 Single tree, greedy cost-sensitive decision tree induction algorithms ........................................ 22 3.2 Multiple tree, non-greedy methods for cost-sensitive decision tree induction............................ 39 3.3 Summary and analysis of the results of the survey ..................................................................... 62 CHAPTER 4: THE DEVELOPMENT OF A NEW MULTI-ARMED BANDIT FRAMEWORK FOR COST-SENSITIVE DECISION TREE LEARNING ........................................................................... 67 4.1 Analysis of previous cost-sensitive decision tree algorithms ..................................................... 67 4.2 A new algorithm for cost-sensitive decision tree learning using multi-armed bandits ............... 74 4.3 Potential problems with the MA_CSDT algorithm .................................................................... 83 4.4 Summary of the development of the MA_CSDT algorithm ....................................................... 92 CHAPTER 5: INVESTIGATING PARAMETER SETTINGS FOR MA_CSDT .............................. 94 5.1 Parameters allowing continuation of process when it is worthwhile ........................................ 101 5.2 Determining how many lever pulls, which version and strategy is desirable ........................... 108 5.3 Investigate taking advantage of different parameter settings to achieve aim ........................... 109 5.4 Developing guidelines for datasets to determine the best combinations of parameter settings 113 5.5 Summary of findings from the investigation ............................................................................ 118 CHAPTER 6: AN EMPIRICAL COMPARISON OF THE NEW ALGORITHM WITH EXISTING COST-SENSITIVE DECISION TREE ALGORITHMS ................................................................... 121 6.1 Empirical comparison results .................................................................................................... 125 6.2 Discussion of the outcome of the empirical evaluation ............................................................ 137 6.3 Summary of the findings of the evaluation ............................................................................... 145 CHAPTER 7: CONCLUSIONS AND FUTURE WORK .................................................................. 147 REFERENCES ................................................................................................................................... 159 APPENDIX ......................................................................................................................................... 169 i A1 Analysis of datasets used by studies from the survey ............................................................... 169 A2 Details of the datasets used in the main evaluation ................................................................... 171 A3 Details of the misclassification costs used in all experiments .................................................. 188 A4 Summary of the attributes in the results dataset ........................................................................ 191 A5 Parameter settings % frequencies of best and worst results all examples and trees only plus frequency of trees not grown or grown ........................................................................................... 192 APPENDIX D ..................................................................................................................................... 193 ii TABLE OF FIGURES Figure 1 Decision tree after ID3 has been applied to the dataset in Table 1 ........................... 11 Figure 2 Taxonomy of Cost-Sensitive Decision Tree Induction Algorithms .......................... 19 Figure 3 A timeline of algorithms ............................................................................................ 21 Figure 4 Decision tree after EG2 has been applied to the dataset in Table 1 .......................... 24 Figure 5 Decision tree when DT with MC has been applied to dataset in Table 1 .................. 31 Figure 6 Linear Machine .......................................................................................................... 34 Figure 7 Example ROC ............................................................................................................ 38 Figure 8 Illustration of mapping .............................................................................................. 42 Figure 9 Multi-tree using the example dataset ......................................................................... 59 Figure 10 Using ICET’s results to demonstrate weaknesses of cost-sensitive decision tree algorithms ................................................................................................................................ 71 Figure 11 Illustration of the single pull and look-ahead bandit in the algorithm .................... 77 Figure 12 Generate P bandits and calculate cost at the end of each path ................................ 79 Figure 13 Multi-Armed Cost-Sensitive Decision Tree Algorithm (MA_CSDT) .................... 81 Figure 14 To calculate the number of potential unique bandit paths in a dataset .................... 85 Figure 15 Results illustrating the fluctuating values obtained using artificial datasets ........... 87 Figure 16 Desired tree chosen by a given strategy .................................................................. 88 Figure 17 Graphs showing do nothing costs versus cost obtained for each of the types of classes .................................................................................................................................... 105 Figure 18 Graphs showing multi-class datasets in their 3 groups of misclassification costs: mixed, low, high .................................................................................................................... 107 Figure 19 Comparing mean values obtained with values obtained by a given strategy ....... 111 Figure 20 Rules extracted using J48 accuracy-based algorithm on examples in the results analysis file ............................................................................................................................ 117 Figure 21 Heart dataset processed using pruned versions of the cost-sensitive algorithms and flare dataset using un-pruned versions of the cost-sensitive algorithms................................ 130 Figure 22 The krk dataset: top processed using pruned version; bottom processed using un- pruned version of cost-sensitive algorithms .......................................................................... 133 Figure 23 Iris dataset processed using the un-pruned version of the cost-sensitive algorithms ................................................................................................................................................ 134 iii TABLE OF TABLES Table 1 Example dataset ‘Television Repair’ .......................................................................... 10 Table 2 Pay-off matrix for Prisoner’s Dilemma ...................................................................... 14 Table 3 Cost-sensitive decision tree induction algorithms categorized with respect to taxonomy by time .................................................................................................................... 20 Table 4 Definitions of equations .............................................................................................. 22 Table 5 Example of a cost matrix of a four class problem ...................................................... 29 Table 6 Typical cost matrix for two-class problems ................................................................ 68 Table 7 Main characteristics
Load more

Recommended publications
  • An Evolutionary Approach for Sorting Algorithms
    ORIENTAL JOURNAL OF ISSN: 0974-6471 COMPUTER SCIENCE & TECHNOLOGY December 2014, An International Open Free Access, Peer Reviewed Research Journal Vol. 7, No. (3): Published By: Oriental Scientific Publishing Co., India. Pgs. 369-376 www.computerscijournal.org Root to Fruit (2): An Evolutionary Approach for Sorting Algorithms PRAMOD KADAM AND Sachin KADAM BVDU, IMED, Pune, India. (Received: November 10, 2014; Accepted: December 20, 2014) ABstract This paper continues the earlier thought of evolutionary study of sorting problem and sorting algorithms (Root to Fruit (1): An Evolutionary Study of Sorting Problem) [1]and concluded with the chronological list of early pioneers of sorting problem or algorithms. Latter in the study graphical method has been used to present an evolution of sorting problem and sorting algorithm on the time line. Key words: Evolutionary study of sorting, History of sorting Early Sorting algorithms, list of inventors for sorting. IntroDUCTION name and their contribution may skipped from the study. Therefore readers have all the rights to In spite of plentiful literature and research extent this study with the valid proofs. Ultimately in sorting algorithmic domain there is mess our objective behind this research is very much found in documentation as far as credential clear, that to provide strength to the evolutionary concern2. Perhaps this problem found due to lack study of sorting algorithms and shift towards a good of coordination and unavailability of common knowledge base to preserve work of our forebear platform or knowledge base in the same domain. for upcoming generation. Otherwise coming Evolutionary study of sorting algorithm or sorting generation could receive hardly information about problem is foundation of futuristic knowledge sorting problems and syllabi may restrict with some base for sorting problem domain1.
    [Show full text]
  • History of Computer Science from Wikipedia, the Free Encyclopedia
    History of computer science From Wikipedia, the free encyclopedia The history of computer science began long before the modern discipline of computer science that emerged in the 20th century, and hinted at in the centuries prior. The progression, from mechanical inventions and mathematical theories towards the modern concepts and machines, formed a major academic field and the basis of a massive worldwide industry.[1] Contents 1 Early history 1.1 Binary logic 1.2 Birth of computer 2 Emergence of a discipline 2.1 Charles Babbage and Ada Lovelace 2.2 Alan Turing and the Turing Machine 2.3 Shannon and information theory 2.4 Wiener and cybernetics 2.5 John von Neumann and the von Neumann architecture 3 See also 4 Notes 5 Sources 6 Further reading 7 External links Early history The earliest known as tool for use in computation was the abacus, developed in period 2700–2300 BCE in Sumer . The Sumerians' abacus consisted of a table of successive columns which delimited the successive orders of magnitude of their sexagesimal number system.[2] Its original style of usage was by lines drawn in sand with pebbles . Abaci of a more modern design are still used as calculation tools today.[3] The Antikythera mechanism is believed to be the earliest known mechanical analog computer.[4] It was designed to calculate astronomical positions. It was discovered in 1901 in the Antikythera wreck off the Greek island of Antikythera, between Kythera and Crete, and has been dated to c. 100 BCE. Technological artifacts of similar complexity did not reappear until the 14th century, when mechanical astronomical clocks appeared in Europe.[5] Mechanical analog computing devices appeared a thousand years later in the medieval Islamic world.
    [Show full text]
  • The History of Computing in the History of Technology
    The History of Computing in the History of Technology Michael S. Mahoney Program in History of Science Princeton University, Princeton, NJ (Annals of the History of Computing 10(1988), 113-125) After surveying the current state of the literature in the history of computing, this paper discusses some of the major issues addressed by recent work in the history of technology. It suggests aspects of the development of computing which are pertinent to those issues and hence for which that recent work could provide models of historical analysis. As a new scientific technology with unique features, computing in turn can provide new perspectives on the history of technology. Introduction record-keeping by a new industry of data processing. As a primary vehicle of Since World War II 'information' has emerged communication over both space and t ime, it as a fundamental scientific and technological has come to form the core of modern concept applied to phenomena ranging from information technolo gy. What the black holes to DNA, from the organization of English-speaking world refers to as "computer cells to the processes of human thought, and science" is known to the rest of western from the management of corporations to the Europe as informatique (or Informatik or allocation of global resources. In addition to informatica). Much of the concern over reshaping established disciplines, it has information as a commodity and as a natural stimulated the formation of a panoply of new resource derives from the computer and from subjects and areas of inquiry concerned with computer-based communications technolo gy.
    [Show full text]
  • Gsoc 2018 Project Proposal
    GSoC 2018 Project Proposal Description: Implement the project idea sorting algorithms benchmark and implementation (2018) Applicant Information: Name: Kefan Yang Country of Residence: Canada University: Simon Fraser University Year of Study: Third year Major: Computing Science Self Introduction: I am Kefan Yang, a third-year computing science student from Simon Fraser University, Canada. I have rich experience as a full-stack web developer, so I am familiar with different kinds of database, such as PostgreSQL, MySQL and MongoDB. I have a much better understand of database system other than how to use it. In the database course I took in the university, I implemented a simple SQL database. It supports basic SQL statements like select, insert, delete and update, and uses a B+ tree to index the records by default. The size of each node in the B+ tree is set the disk block size to maximize performance of disk operation. Also, 1 several kinds of merging algorithms are used to perform a cross table query. More details about this database project can be found here. Additionally, I have very solid foundation of basic algorithms and data structure. I’ve participated in division 1 contest of 2017 ACM-ICPC Pacific Northwest Regionals as a representative of Simon Fraser University, which clearly shows my talents in understanding and applying different kinds of algorithms. I believe the contest experience will be a big help for this project. Benefits to the PostgreSQL Community: Sorting routine is an important part of many modules in PostgreSQL. Currently, PostgreSQL is using median-of-three quicksort introduced by Bentley and Mcllroy in 1993 [1], which is somewhat outdated.
    [Show full text]
  • Software Studies: a Lexicon, Edited by Matthew Fuller, 2008
    fuller_jkt.qxd 4/11/08 7:13 AM Page 1 ••••••••••••••••••••••••••••••••••••• •••• •••••••••••••••••••••••••••••••••• S •••••••••••••••••••••••••••••••••••••new media/cultural studies ••••software studies •••••••••••••••••••••••••••••••••• ••••••••••••••••••••••••••••••••••••• •••• •••••••••••••••••••••••••••••••••• O ••••••••••••••••••••••••••••••••••••• •••• •••••••••••••••••••••••••••••••••• ••••••••••••••••••••••••••••••••••••• •••• •••••••••••••••••••••••••••••••••• F software studies\ a lexicon ••••••••••••••••••••••••••••••••••••• •••• •••••••••••••••••••••••••••••••••• ••••••••••••••••••••••••••••••••••••• •••• •••••••••••••••••••••••••••••••••• T edited by matthew fuller Matthew Fuller is David Gee Reader in ••••••••••••••••••••••••••••••••••••• •••• •••••••••••••••••••••••••••••••••• This collection of short expository, critical, Digital Media at the Centre for Cultural ••••••••••••••••••••••••••••••••••••• •••• •••••••••••••••••••••••••••••••••• W and speculative texts offers a field guide Studies, Goldsmiths College, University of to the cultural, political, social, and aes- London. He is the author of Media ••••••••••••••••••••••••••••••••••••• •••• •••••••••••••••••••••••••••••••••• thetic impact of software. Computing and Ecologies: Materialist Energies in Art and A digital media are essential to the way we Technoculture (MIT Press, 2005) and ••••••••••••••••••••••••••••••••••••• •••• •••••••••••••••••••••••••••••••••• work and live, and much has been said Behind the Blip: Essays on the Culture of •••••••••••••••••••••••••••••••••••••
    [Show full text]
  • John W. Mauchly Papers Ms
    John W. Mauchly papers Ms. Coll. 925 Finding aid prepared by Holly Mengel. Last updated on April 27, 2020. University of Pennsylvania, Kislak Center for Special Collections, Rare Books and Manuscripts 2015 September 9 John W. Mauchly papers Table of Contents Summary Information....................................................................................................................................3 Biography/History..........................................................................................................................................4 Scope and Contents....................................................................................................................................... 6 Administrative Information........................................................................................................................... 7 Related Materials........................................................................................................................................... 8 Controlled Access Headings..........................................................................................................................8 Collection Inventory.................................................................................................................................... 10 Series I. Youth, education, and early career......................................................................................... 10 Series II. Moore School of Electrical Engineering, University of Pennsylvania.................................
    [Show full text]
  • Session II – Unit I – Fundamentals
    Tutor:- Prof. Avadhoot S. Joshi Subject:- Design & Analysis of Algorithms Session II Unit I - Fundamentals • Algorithm Design – II • Algorithm as a Technology • What kinds of problems are solved by algorithms? • Evolution of Algorithms • Timeline of Algorithms Algorithm Design – II Algorithm Design (Cntd.) Figure briefly shows a sequence of steps one typically goes through in designing and analyzing an algorithm. Figure: Algorithm design and analysis process. Algorithm Design (Cntd.) Understand the problem: Before designing an algorithm is to understand completely the problem given. Read the problem’s description carefully and ask questions if you have any doubts about the problem, do a few small examples by hand, think about special cases, and ask questions again if needed. There are a few types of problems that arise in computing applications quite often. If the problem in question is one of them, you might be able to use a known algorithm for solving it. If you have to choose among several available algorithms, it helps to understand how such an algorithm works and to know its strengths and weaknesses. But often you will not find a readily available algorithm and will have to design your own. An input to an algorithm specifies an instance of the problem the algorithm solves. It is very important to specify exactly the set of instances the algorithm needs to handle. Algorithm Design (Cntd.) Ascertaining the Capabilities of the Computational Device: After understanding the problem you need to ascertain the capabilities of the computational device the algorithm is intended for. The vast majority of algorithms in use today are still destined to be programmed for a computer closely resembling the von Neumann machine—a computer architecture outlined by the prominent Hungarian-American mathematician John von Neumann (1903–1957), in collaboration with A.
    [Show full text]
  • The History of Computer Science
    TheThe HistHistoryory ooff CompComputeruter ScieSciencence BBy:y: SSaarahrah OOpppeperr BeBeffoorree 11990000 . PPeeopoplele hadhad bebeenen ususiningg memecchanhanicicaall dedevvicesices toto aaidid calculaticalculationon foforr thothoususaandndss ofof yyeearsars . EExamplesxamples . thethe abacuabacuss proprobablybably exexistedisted inin BabyloniaBabylonia (p(presentresent-da-dayy IraIraq)q) ababoutout 30003000 BB.C.E.C.E . AncientAncient GGreeksreeks developedevelopedd somesome ververyy sophsophiiststiicatcateded aanalognalog comcomputputers.ers. PePeooppllee ooff EaEarrllyy CSCS . JohnJohn NapieNapierr-- iinnvvenentteded NNaapiepierr's's rroodsds (s(soometmetimesimes calledcalled "N"Napapier'ier'ss bboneoness")") inin 16161010 ttoo simplifsimplifyy tthehe ttaskask ofof mumultiplicltiplicaattionion . BlaBlaiisese PPasascal-cal- inin 11646411 builtbuilt aa mechamechanicnicaall adaddingding machinemachine . GoGotttftfririeedd WWilheilhellmm LLeibneibniiz-z- aadvdvooccaatteded useuse ofof tthehe bbinainarryy sysystestemm foforr ddoingoing calccalculaulatiotionsns . CChharlarleess BaBabbbbagage-e- wwoorrkedked onon ttwwoo memecchahanicnicaall ddevicevices:es: tthhee DDififfeferreencncee EnEnginegine andand ththee AnAnalyalytticicaall EEngngiinnee (a(a precursprecursoorr ofof tthehe modmodernern digitdigitalal ccoompumputeterr)) MoMorree PePeoopplele FFrroomm EaEarrlyly YeYeaarsrs . JoJosesepphh-M-Maaririee JaJaccqquuaardrd-- iinnvevenntetedd aa lolooomm ththaatt cocouulldd wweeaaveve cocompmplilicacatetedd ppaattteternrnss ddeescriscribbeedd
    [Show full text]
  • A Repository of Unix History and Evolution
    Empirical Software Engieering 10.1007/s10664-016-9445-5 A Repository of Unix History and Evolution Diomidis Spinellis Abstract The history and evolution of the Unix operating system is made avail- able as a revision management repository, covering the period from its inception in 1972 as a five thousand line kernel, to 2016 as a widely-used 27 million line system. The 1.1gb repository contains 496 thousand commits and 2,523 branch merges. The repository employs the commonly used Git version control system for its storage, and is hosted on the popular GitHub archive. It has been created by synthesizing with custom software 24 snapshots of systems developed at Bell Labs, the University of California at Berkeley, and the 386bsd team, two legacy repositories, and the modern repository of the open source Freebsd system. In total, 973 individual contributors are identified, the early ones through primary research. The data set can be used for empirical research in software engineering, information systems, and software archaeology. Keywords Software archeology · Unix · configuration management · Git 1 Introduction The Unix operating system stands out as a major engineering breakthrough due to its exemplary design, its numerous technical contributions, its impact, its develop- ment model, and its widespread use (Gehani 2003, pp. 27{29). The design of the Unix programming environment has been characterized as one offering unusual The work has been partially funded by the Research Centre of the Athens University of Eco- nomics and Business, under the Original Scientific Publications framework (project code EP- 2279-01) and supported by computational time granted from the Greek Research & Technology Network (grnet) in the National hpc facility | aris | under project id pa003005-cdolpot.
    [Show full text]
  • Early History[Edit]
    he history of computer science began long before the modern discipline of computer science that emerged in the 20th century, and hinted at in the centuries prior.[dubious – discuss][citation needed] The progression, from mechanical inventions and mathematical theories towards the modern concepts and machines, formed a major academic field and the basis of a massive worldwide industry.[1] Contents [show] Early history[edit] The earliest known as tool for use in computation was the abacus, developed in period 2700–2300 BCE in Sumer[citation needed]. The Sumerians' abacus consisted of a table of successive columns which delimited the successive orders of magnitude of their sexagesimal number system.[2] Its original style of usage was by lines drawn in sand with pebbles[citation needed]. Abaci of a more modern design are still used as calculation tools today.[3] The Antikythera mechanism is believed to be the earliest known mechanical analog computer.[4] It was designed to calculate astronomical positions. It was discovered in 1901 in the Antikythera wreck off the Greek island of Antikythera, between Kythera and Crete, and has been dated to c. 100 BCE. Technological artifacts of similar complexity did not reappear until the 14th century, when mechanical astronomical clocks appeared inEurope.[5] Mechanical analog computing devices appeared a thousand years later in the medieval Islamic world. Examples of [6] devices from this period include the equatorium by Arzachel, the mechanical geared astrolabe by Abū Rayhān al- [7] [8] Bīrūnī, and the torquetum by Jabir ibn Aflah. Muslim engineers built a number of automata, including some musical automata that could be 'programmed' to play different musical patterns.
    [Show full text]
  • Technical Report
    Technical Report Research Roadmap on Cooperating Objects (CONET Roadmap 2009) Mário Alves Björn Andersson Nouha Baccour Anis Koubaa Ricardo Severino Paulo Gandra de Sousa CISTER-TR-131109 Version: Date: 11/18/2013 Technical Report CISTER-TR-131109 Research Roadmap on Cooperating Objects (CONET Roadmap 2009) Research Roadmap on Cooperating Objects (CONET Roadmap 2009) Mário Alves, Björn Andersson, Nouha Baccour, Anis Koubaa, Ricardo Severino, Paulo Gandra de Sousa CISTER Research Unit Polytechnic Institute of Porto (ISEP-IPP) Rua Dr. António Bernardino de Almeida, 431 4200-072 Porto Portugal Tel.: +351.22.8340509, Fax: +351.22.8340509 E-mail: [email protected], [email protected], , [email protected], [email protected], [email protected] http://www.cister.isep.ipp.pt Abstract © CISTER Research Unit 1 www.cister.isep.ipp.pt Research Roadmap on Cooperating Objects Pedro Jos´eMarr´on, Stamatis Karnouskos, Daniel Minder and the CONET consortium Version: 1851 Date: 2010-01-05 18:54:37 +0100 (Tue, 05 Jan 2010) © All rights reserved. The CONET Consortium 2009 (www.cooperating-objects.eu) Europe Direct is a service to help you find answers To your questions about the European Union Freephone number (*): 00 800 67891011 (*) Certain mobile telephone operators do not allow access to00800numbersorthesecallsmaybebilled. More information on the European Union is available on the Internet (http://europa.eu). Cataloguing data can be found at the end of this publication. Luxembourg: Office for Official Publications of the European Communities, 2009 ISBN 978-92-79-12046-6 DOI 10.2759/11566 Cover background image: © www.pixblix.com CONET logo: © University of Bonn Neither the European Commission nor any person acting on its behalf is responsible for the use which might be made of the information contained in thepresentpublication.
    [Show full text]
  • Search Engine Cookie?
    Online Search And Society: Could Your Best Friend Be Your Worst Enemy? By Rachel Noonan Submitted to OCAD University in partial fulfillment of the requirements for the degree of Master of Design in Strategic Foresight and Innovation Toronto, Ontario, Canada, December, 2017 © Rachel Noonan, 2017 This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivatives 2.5 Canada License. To see the license, go to https://creativecommons.org/licenses/by-nc-sa/2.5/ca/or write to Creative Commons, 300 - 171 2nd St, San Francisco, CA 94105, USA Automated reward systems like YouTube algorithms necessitate exploitation in the same way that capitalism necessitates exploitation, and if you’re someone who bristles at the second half of that equation then maybe this should be what convinces you of its truth. Exploitation is encoded into the systems we are building, making it harder to see, harder to think and explain, harder to counter and defend against. JAMES BRIDLE, MEDIUM ii Principal Advisor: Suzanne Stein Secondary Advisor: Tessa Sproule Copyright Notice This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivatives 2.5 Canada License. To see the license, go to http://creativecommons.org/licenses/by- ‐nc-‐nd/2.5/ca/ or write to Creative Commons, 171 Second Street, Suite 300, San Francisco, CA 94105, USA You are free to Share — to copy, distribute, and transmit the work. Under the following conditions Attribution — you must give the original authors credit. Noncommercial — you may not use this work for commercial purposes. No Derivative Works — you may not alter, transform, or build upon this work.
    [Show full text]