Data mining, Bongard problems, and the concept of pattern conception
|
|
- Raymond Bridges
- 6 years ago
- Views:
Transcription
1 Data mining, Bongard problems, and the concept of pattern conception A. Linhares Getulio Vargas Foundation, Brazil Abstract One of the major problems of data mining systems is the identification of classes, categories, and concepts. We introduce a new framework for categorization which is based on the concept of pattern conception (a term that may be contrasted to pattern recognition, pattern matching, pattern perception, etc.). There are important distinctions between pattern conception and the mainstream pattern recognition models; furthermore, these distinctions lead us to new categorization information-processing architectures. The first major distinction tells us that there is more than one correct conception for each individual pattern. Each pattern may have numerous segmentations and descriptions which are fundamentally distinct but equally correct in a deep sense. Another striking distinction of pattern conception is the capability to see as, in which context will guide the interpretation of data such as that one object may be seen as if it were another type of object, or as if it were occupying the position or role of other objects. A final and related distinction is that there should be a relativity theory view of concepts and categories, in which concepts are both dejlned by their relations to other concepts and activated from the spread of activation of other concepts. In this work, we analyze how these distinctions appear under three distinct application domains: (I) the notorious case of Bongard problems; (ii) letter-string analogies; and (iii) the game of chess (viewed as a pattern analysis problem). It may be concluded that data mining methods must be able to handle these distinctions if they are to be effective at pattern conception, and, thus, to a wide class of information categorization problems.
2 604 Data Mining III 1 Introduction An outstanding problem for data mining arises from the fact that raw data does not come pre-classified into clear categories, clusters, or concepts. Consider a security system that has to mine (in a massive set of images) to identify a specific person precisely the type of hard AI multidisciplinary problem that joins data mining and pattern classification. The major information processing paradigms to classify and categorize raw patterns are lacking some important capabilities. This paper analyzes these missing capabilities and introduces a new framework for categorization which is based on the concept of pattern conception, a term that may be contrasted to pattern recognition, pattern matching, pattern perception, etc. Some important distinctions between pattern conception and the mainstream pattern recognition models are identified; furthermore, these distinctions lead us to new categorization iuformationprocessing architectures. Three distinct application domains reveal the mechanisms involved in pattern conception: (i) the notorious case of Bongard problems; (ii) the game of chess, viewed as a pattern analysis problem; and, finally, the much simpler (and now solved) case of (iii) letter-string analogies which provides a pathway for a framework for pattern conception which is briefly sketched on section 5. Let us start our analysis with Bongard problems. 2 The case of Bongard problems Bongard problems (fig. 1) are a set of pattern understanding problems proposed by the Russian scientist Michail Bongard [1]. Each problem holds two sets of boxed images, and the task required is to find the aspect that distinguishes set A from set B. Data mining research has a lot to gain from Bongard problems, as they are related to some of the major challenges presented by Usama Fayyad [4], such as the CCill-dejined queries such as [to] find records similar to records in table A but not similar to table B, or maybe tasks like to search by example in multimedia databases. An initial point that can be brought up front is that in these problems, patterns are perceived in terms of concepts. That means that raw data is perceived in terms of specific higher-level structures (and in terms of the relation of this structure to other structures). Thus, in BP 10, information processing must go from the particular visual idiosyncrasy of each box to the clear-cut, abstract, and conceptual answer: triangles versus rectangles, discarding, at some point in the process, the visual information itself, in turn for the symbolic, conceptual information.
3 zil EIEI Im RI mlw mim Data Mining III 605 El El RI El mm EIEIIDZZI I El El 91 El El o 0 00 m Figure 1. Bongard problems 10, 19,52, and 91 [From M. M.Bongard, 1970] In BP91, something interesting happens: note how the conception of the squares differs in classes A and B: the square in class B is not taken as a unit; it is not conceived as a square at all. It is interpreted as four individually distinct line segments that meet at endpoints. At the same time, in class A, each of the squares is taken as a single unit. Taken as a whole, they are not broken down into their composing line segments; a direct conclusion is that there are multiple ways of conceiving the same original data (see Linhares [6]). The term recognition implies the existence of things to be recognized and also of a set of categories to recognize them into, leading easily to the idea that each thing to be recognized has a corresponding predefiied category to be recognized as being an instance of. Pattern conception, on the other hand, implies that a specific pattern can be conceived as some particular concept (as opposed to must be conceived). Under this view, a peculiar pattern is not such a thing to be recognized at all, as there may be many competing conceptions. Thus we may conceive a triangular arrangement as a unique object, as three separate objects, or as something else entirely (as Bongard problems show). By doing this we are applying the process of seeing as, conceiving a pattern as some abstract concept, and that process is unlike merely labeling or recognizing an instance of something. Figure 2 provides examples of visual arrangements that evoke a triangle; under the proper context a Bongard problem could include all of them as triangles. On the surface each of the boxes has no triangle; however, each one evokes a triangle, and they reinforce each other in the sense that a clear idea of a triangle emerges. A triangle, however, is a three-sided polygon (formed by line segments) with a precise mathematical definition; either something is a triangle or it is not. Thee point is, these figures cannot be recognized as triangles, but tiey can be conceived as triangles in an abstract sense. So what is involved in this conception process? Let us look closer at this process in the form of pattemanalysis chess.
4 606 Data Mining III mll El12S Figure 2. Conception versus recognition: we can conceive triangles from these figures, but we cannot recognize any triangles in them. 3 Pattern-analysis chess Chess has been traditionally viewed in AI as a classic symbolic-paradigm search problem: given an initial state, and an overarching goal, the system searches through a myriad of candidate options in search of an optimum. However, as psychologists have repeatedly pointed out, humans do not play chess by bruteforce search [2,3,9]. Skilled human players hardly search trough that great number of nodes of the game tree explored by computer programs. Human masters, however, are exceptionally skilled in reconstructing the board positions after having spotted them for some seconds. It is notorious that humans perceive a chessboard given their previous experience of the game, rapidly structuring a position into familiar terms; embedded in this perception lies the intelligence of the human chess player. It is a great scientific challenge to design a chess program which would simulate the cognitive processing of a skilled human chess player. It is known that humans carve board positions into chunks, and eye saccade studies have shown that effort is concentrated in the most important regions of the board, with special emphasis at pieces under chess relations (attacks and defenses). Let us consider the board position of Fig 3. Consider the relation between the white knight and the black queen: the first can reach (attack) the queen in 1 move, while the queen can attack it in 2 moves. This kind of relationship can be described by a graph in which each (directed weighted) edge denotes the minimum number of movements between two pieces (represented by nodes). This representational scheme seems to be in line with the view that chess players characterize the board spatially [3, p.7]. Note that many abstract relations are described in the graph. For instance, we can perceive a fork as displayed in the graph, but it is not the only fork possible, it is, however, the more relevant one for the interpretation of the situation at hand. This is once again a process of pattern conception. There are multiple candidate conceptions of how the pieces combine to defend and to attack the opposing camp. Each piece threatens to occupy some board squares in the following several moves; it is how these threats are conceived as a whole that differentiate skilled fi-om unskilled human players, and to enable a machine to conceive the board in an insightful way is a major challenge for data mining research. This multiplicity of interpretations (conceptions) that change according to context is a first similarity to Bongard problems.
5 Data Mining III 607 A second similarity is the view of analogy between chunks (in the case of chess, it is more appropriate to use the term chunk instead of concept, as the term concept evokes the possibility of being expressible). If we look at the graph and discard the identity of the pieces, we can obtain a set of positions that are analogous to this one in an abstract and profound sense: positions in which the very same pressures emanate from a radically distinct variety of positions (as a trivial example, the fork could be emanating from a black queen, and nothing essential would be changed in the graph structure). A third similarity with Bongard problems is that each particular board position is concrete, rich in all its peculiarity and its unstructured idiosyncrasy. But the conception in the graph representation is, the moment one discards the identity of the pieces, purely abstract and structured. Figure 3. White to move: mate in one. Spatial graph representations maybe used for chunks to be mined in KDD. If we consider the game of chess as a data mining problem, it can be said that there is a language of chess (which is gradually acquired by human players over the course of one s life; enabling one to distinguish certain pressures on the board, prioritizing them over other pressures; in fact, it enables skilled players to see the dangers and opportunities overlooked by less skilled players). This language is composed of chunks, which denote threats, blocks, defenses, forks, and a multitude of specific configurations. It is an outstanding challenge to data mining systems to identify such a language. These points having been raised, let us look at a third ill-structured problem type with these characteristics: letter string analogies. From this simpler problem, we may sketch an information processing framework for pattern conception.
6 608 Data Mining III 4 Letter-string analogies Consider the problem of letter string analogies, such as: if ABC changes to ABD, how can we change IJK in a similar way? Though these problems are much simpler than either Bongard problems or pattern-analysis chess, they still require a considerable effort of pattern conception. First of all, there is a multiplicity of possibilities of conceiving each particular string. Let us analyze a simple example: if AABC changes to AABD, how can we change IJKK in a similar way? One may be tempted at first to answer IJKL, by interpreting the transformation as a simple change last letter to its successor. So this is one possibility; but it does not consider the fact that in the original strings, the AA s appear as together a group; one way to account for this in the answer would be to use IJLL, by applying a rule such as change last group of letters to its successor. Other possibilities abound, such as JJKK (change the first letter to its successor, nearly inverting the original rule and obtaining an awkward sounding configuration, given its asymmetry with the originals). Two possibilities preserve symmetry with the original transformation: IJLK, and HJKK. The first one, IJLK, comes from the conception of the original transformation as: A-ABC=>A-ABD. This implies the rule change last letter of the increasing sequence to successor, which, when applied to IJK-K, yields IJLK. This is one way to conceive the strings and the transformation. Another way is AA-B-C=>AA-B-D, with the rule, change last letter to successor, being transformed to change FIRST letter to PREDECESSOR, in order to account for a symmetric relation between AA-B-C and I-J-KK, and also between AA-B- D and H-J-KK. In this manner, the KK stays fixed (just like the AA remains) and also the relation B-D is symmetric to H-J, despite the inversion of order. So once again we have multiple interpretations: AABC interpreted as AA-B- C; A-ABC; or something else entirely. Each of these interpretations will lead to a specific conceptual (chunk) activation: AA-B-C may activate the concept same letter group, while A-ABC activates increasing sequence ; each conceptual activation in turn yields distinct analogous solutions to the problem. Letter-string analogies are some of the few problems of pattern conception that have been solved satisfactorily (see [5,8]); hence they point us to promising pathways towards the solution of Bongard problems, pattern-analysis chess, illdefined queries such as to find records similar to those in table A but not similar to those in table B, and search by example in multimedia databases. In the following section, we abstract from the particular model used in letter-stiing analogies by Mitchell [8] to sketch a framework for pattern conception. 5 A framework for pattern conception Let us consider the information processing involved in such a pattern conception process. The system must start with patterns composed of raw uncategorized data (such as visual images). At this point there is no identity neither individuality, as no objects have been identified. Thus, in Bongard problems, the
7 Data Mining III 609 patterns are two-dimensional binary images; no objects and structures have been identified (and thus no object has been individualized). In pattern analysis chess, no blocking pieces, candidate moves, threats or opportunities are identified, and, though the pieces are placed in their positions, the situation still has no structure and is not carved into chtniks. In letter string analogies, each particular string has yet to be carved into blocks, such that once again its structure remains to be discovered. What each of the patterns do present is their peculiarity, the specific idiosyncratic arrangements that form that particular pattern [10]. 1- Patterns Peculiarity Particularity Idiosyncrasy Concrete Concepts are activated Concepts Identity - :&: :li y Active concepts attempt to fit the patterns 2Activation spreads through a conceptual network Figure 4. A tiamework for pattern conception, Then information processing starts: at this point there are no expectations about the pattern, so processing goes in a bottom up fashion, driven by the data. The objective is to obtain a coherent and clear conception of what is in the pattern and thus understand what makes set A different from set B, or how to proceed given a specific chess position. Gradually the data activate chunks or concepts (which are defined by their specific relations to proximate concepts in a network). So a small comer at a Bongard figure triggers activation of the concept rectangle ; a fork in a chess position activates a particular chunk (to describe the attack) and a JJ sequence in a letter string triggers a concept such same letter group. Then the activation of concepts spreads. Activation may spread from the concept (node) rectangle to the concept triangle or maybe polygon. It may spread from our specific fork chunk to the related chunks that better describe the mate in one situation; it may spread from same letter group to the broader group (see Mitchell [8]). This is an important step, because these newly activated concepts create top-down pressure to focus the search to new possibilities, so this is the point where expectations enter into the game. From now on the processing has both bottom-up and top-down pressures co-existing. Each evoked concept has specific methods for identi~ing its candidate instances in the patterns. This is not a process of recognition because the process takes into consideration not only the quality of the match, but also the expectations given by the level of activation of each concept. Thus, each triangle of figure 2 does not satisfi, individually, the concept triangle (which cannot be
8 610 Data Mining III pattern-matched), but still, since the conceptual activation is so high, reinforced by the other boxes, the patterns are satisfactorily conceived as triangles. This framework thus produces an activation of concepts and a fit of how well they match the patterns; pointing towards solutions to the problem of illdefined queries such as search by example. The model is flexible enough to account for the contextual pressures that make a specific record similar or dissimilar to other records. The reader is referenced to [8] for detailed discussion of this framework. 6 Conclusion Bongard problems and pattern analysis chess are deeply related to tasks such as search by example; these ill stmctured problems are crucial for data mining research. However, a glimpse at recent books on data mining shows the whole range of methods, which include statistical reasoning, machine learning, inductive logic programming, K-nearest neighbors, decision trees, association rules, neural networks, genetic algorithms, belief networks, classification rules, numeric prediction, clustering, inferring rules, covering algorithms, linear models, support vector machines, and others. These methods are inadequate for Bongard problems, pattern-analysis chess, and for such ill-defined data queries, because they fail to account for one or more of the basic distinctions which configure the need for a new class of pattern conception methods. Pattern conception appears in contrast to the widespread methods of pattern matching and pattern recognition, in that patterns are perceived by an activation of symbolic concepts; there are multiple candidate activations for each case; activation spread to related concepts, which constrain the further search; and finally the activation itself becomes part of the solution (as the conceived concepts). Three classes of problems demonstrate some possible applications of such methods: Bongard problems, letter-string analogies, and the pattern-analysis chess. In each of these problems, patterns are perceived in terms of concepts. Pattern conception interprets particular idiosyncratic patterns as evocations of abstract symbolic concepts. Instead of the preciseness evoked by the term pattern recognition, in pattern conception nothing ever is or is not absolutely recognized; things are conceived by indirectly evoking concepts. If patterns evoke concepts, a triangle may sometimes evoke a set of separate line segments instead of being recognized as a unique object. An attack may be conceived as a chess fork, but the fork may be ignored if a competing conception for a checkmate becomes active. A string sequence JKL may evoke a concept increasing sequence. Implied in this view are the multiple possible interpretations for even the simplest clear-cut pattern. Each peculiar pattern is conceived as an abstract concept. Here analogies play a key part, as things may be like in an ill-defined sense without being equal. Thus we may have the images of figure 2 as being like each other; we may imagine new chess positions with the same structure of the graph proposed in figure 3, but with distinct pieces playing those roles. Concepts are relative
9 Data Mining III 611 to one another, in two ways: first, the activation of a concept stored in long term memory propagates activation to related concepts and determines the further search; finally, each concept is defined by the very specific relations it holds to other concepts. Though this paper abstracts the solution framework proposed in [8], we find ourselves still in an early stage of knowledge to propose specific solution methods (such that that is not the intended goal here); our main contribution being one of problem analysis, regarding the outstanding challenge brought by a problem of overwhelming importance to Bongard problems, pattern-analysis chess, ill-defined queries such as to find records similar to those in table A but not similar to those in table B, and search by example in multimedia databases. These are critical issues for data mining research, and a further understanding of the problem of pattern conception seems central to this undertaking. References [1] Bongard, M. M., Pattern Recognition, Spartan Books, New York, [2] Chase, W. G., and Simon, H.A., Perception in Chess, Cognitive Psycholog 4,55-81 (1973). [3] de Groot, A.D., Thought and choice in chess. Mouton, New York, [4] Fayyad, U., Editorial, Data Mining and Knowledge Discovey 2, (1998). [5] Hofstadter, D., Fluid Concepts and Creative Analogies, Basic Books, New York, [6] Linhares, A., A glimpse at the metaphysics of Bongard problems. Artijkial Intelligence 121, ,2000 [7] Linhares, A. Evaluating the FARG architecture for pattern analysis chess. Manuscript in preparation, Getulio Vargas Foundation, [8] Mitchell, M., Analogy-making as perception, MIT Press, Cambridge, MA, [9] Simon, H.A., and Chase, W. G., Skill in Chess, American Scientist 61, , [10] Smith, B. C., On the origin of objects, MIT Press, London, 1996
Data mining of chess chunks: a novel distance-based structure
Data mining of chess chunks: a novel distance-based structure A. Linhares The Getulio Vargas Foundation, Brazil Abstract What can the disciplines of artificial intelligence and the cognitive sciences obtain
More informationChess Beyond the Rules
Chess Beyond the Rules Heikki Hyötyniemi Control Engineering Laboratory P.O. Box 5400 FIN-02015 Helsinki Univ. of Tech. Pertti Saariluoma Cognitive Science P.O. Box 13 FIN-00014 Helsinki University 1.
More informationImage Extraction using Image Mining Technique
IOSR Journal of Engineering (IOSRJEN) e-issn: 2250-3021, p-issn: 2278-8719 Vol. 3, Issue 9 (September. 2013), V2 PP 36-42 Image Extraction using Image Mining Technique Prof. Samir Kumar Bandyopadhyay,
More informationOur visual system always has to compute a solid object given definite limitations in the evidence that the eye is able to obtain from the world, by
Perceptual Rules Our visual system always has to compute a solid object given definite limitations in the evidence that the eye is able to obtain from the world, by inferring a third dimension. We can
More informationThe Use of Memory and Causal Chunking in the Game of Shogi
The Use of Memory and Causal Chunking in the Game of Shogi Takeshi Ito 1, Hitoshi Matsubara 2 and Reijer Grimbergen 3 1 Department of Computer Science, University of Electro-Communications < ito@cs.uec.ac.jp>
More informationCREATIVE SYSTEMS THAT GENERATE AND EXPLORE
The Third International Conference on Design Creativity (3rd ICDC) Bangalore, India, 12th-14th January 2015 CREATIVE SYSTEMS THAT GENERATE AND EXPLORE N. Kelly 1 and J. S. Gero 2 1 Australian Digital Futures
More informationMAS336 Computational Problem Solving. Problem 3: Eight Queens
MAS336 Computational Problem Solving Problem 3: Eight Queens Introduction Francis J. Wright, 2007 Topics: arrays, recursion, plotting, symmetry The problem is to find all the distinct ways of choosing
More informationObject Perception. 23 August PSY Object & Scene 1
Object Perception Perceiving an object involves many cognitive processes, including recognition (memory), attention, learning, expertise. The first step is feature extraction, the second is feature grouping
More information5.4 Imperfect, Real-Time Decisions
5.4 Imperfect, Real-Time Decisions Searching through the whole (pruned) game tree is too inefficient for any realistic game Moves must be made in a reasonable amount of time One has to cut off the generation
More informationTo be published by IGI Global: For release in the Advances in Computational Intelligence and Robotics (ACIR) Book Series
CALL FOR CHAPTER PROPOSALS Proposal Submission Deadline: September 15, 2014 Emerging Technologies in Intelligent Applications for Image and Video Processing A book edited by Dr. V. Santhi (VIT University,
More informationMSc(CompSc) List of courses offered in
Office of the MSc Programme in Computer Science Department of Computer Science The University of Hong Kong Pokfulam Road, Hong Kong. Tel: (+852) 3917 1828 Fax: (+852) 2547 4442 Email: msccs@cs.hku.hk (The
More informationTexas Hold em Inference Bot Proposal. By: Brian Mihok & Michael Terry Date Due: Monday, April 11, 2005
Texas Hold em Inference Bot Proposal By: Brian Mihok & Michael Terry Date Due: Monday, April 11, 2005 1 Introduction One of the key goals in Artificial Intelligence is to create cognitive systems that
More informationAIEDAM Special Issue: Sketching, and Pen-based Design Interaction Edited by: Maria C. Yang and Levent Burak Kara
AIEDAM Special Issue: Sketching, and Pen-based Design Interaction Edited by: Maria C. Yang and Levent Burak Kara Sketching has long been an essential medium of design cognition, recognized for its ability
More informationTactics Time. Interviews w/ Chess Gurus John Herron Interview Tim Brennan
Tactics Time Interviews w/ Chess Gurus John Herron Interview Tim Brennan 12 John Herron Interview Timothy Brennan: Hello, this is Tim with http://tacticstime.com and today I have a very special guest,
More informationMITECS: Chess, Psychology of
Page 1 of 5 Historically, chess has been one of the leading fields in the study of EXPERTISE (see De Groot and Gobet 1996 and Holding 1985 for reviews). This popularity as a research domain is explained
More informationREPRESENTATION, RE-REPRESENTATION AND EMERGENCE IN COLLABORATIVE COMPUTER-AIDED DESIGN
REPRESENTATION, RE-REPRESENTATION AND EMERGENCE IN COLLABORATIVE COMPUTER-AIDED DESIGN HAN J. JUN AND JOHN S. GERO Key Centre of Design Computing Department of Architectural and Design Science University
More informationVisual Rules. Why are they necessary?
Visual Rules Why are they necessary? Because the image on the retina has just two dimensions, a retinal image allows countless interpretations of a visual object in three dimensions. Underspecified Poverty
More informationa b c d e f g h i j k l m n
Shoebox, page 1 In his book Chess Variants & Games, A. V. Murali suggests playing chess on the exterior surface of a cube. This playing surface has intriguing properties: We can think of it as three interlocked
More informationLaboratory 1: Uncertainty Analysis
University of Alabama Department of Physics and Astronomy PH101 / LeClair May 26, 2014 Laboratory 1: Uncertainty Analysis Hypothesis: A statistical analysis including both mean and standard deviation can
More information37 Game Theory. Bebe b1 b2 b3. a Abe a a A Two-Person Zero-Sum Game
37 Game Theory Game theory is one of the most interesting topics of discrete mathematics. The principal theorem of game theory is sublime and wonderful. We will merely assume this theorem and use it to
More informationAn Experiment in Students Acquisition of Problem Solving Skill from Goal-Oriented Instructions
An Experiment in Students Acquisition of Problem Solving Skill from Goal-Oriented Instructions Matej Guid, Ivan Bratko Artificial Intelligence Laboratory Faculty of Computer and Information Science, University
More informationCPS331 Lecture: Agents and Robots last revised November 18, 2016
CPS331 Lecture: Agents and Robots last revised November 18, 2016 Objectives: 1. To introduce the basic notion of an agent 2. To discuss various types of agents 3. To introduce the subsumption architecture
More information5.4 Imperfect, Real-Time Decisions
116 5.4 Imperfect, Real-Time Decisions Searching through the whole (pruned) game tree is too inefficient for any realistic game Moves must be made in a reasonable amount of time One has to cut off the
More informationTowards a novel method for Architectural Design through µ-concepts and Computational Intelligence
Towards a novel method for Architectural Design through µ-concepts and Computational Intelligence Nikolaos Vlavianos 1, Stavros Vassos 2, and Takehiko Nagakura 1 1 Department of Architecture Massachusetts
More informationSEARCHING is both a method of solving problems and
100 IEEE TRANSACTIONS ON COMPUTATIONAL INTELLIGENCE AND AI IN GAMES, VOL. 3, NO. 2, JUNE 2011 Two-Stage Monte Carlo Tree Search for Connect6 Shi-Jim Yen, Member, IEEE, and Jung-Kuei Yang Abstract Recently,
More informationCPS331 Lecture: Agents and Robots last revised April 27, 2012
CPS331 Lecture: Agents and Robots last revised April 27, 2012 Objectives: 1. To introduce the basic notion of an agent 2. To discuss various types of agents 3. To introduce the subsumption architecture
More informationDecision-making and strategic thinking through analogies
Decision-making and strategic thinking through analogies Alexandre Linhares 1, 2 1. Center for Research on Concepts and Cognition, Indiana University, Bloomington 2. EBAPE / Getulio Vargas Foundation,
More informationHOW CAN CAAD TOOLS BE MORE USEFUL AT THE EARLY STAGES OF DESIGNING?
HOW CAN CAAD TOOLS BE MORE USEFUL AT THE EARLY STAGES OF DESIGNING? Towards Situated Agents That Interpret JOHN S GERO Krasnow Institute for Advanced Study, USA and UTS, Australia john@johngero.com AND
More informationGrade 6. Prentice Hall. Connected Mathematics 6th Grade Units Alaska Standards and Grade Level Expectations. Grade 6
Prentice Hall Connected Mathematics 6th Grade Units 2004 Grade 6 C O R R E L A T E D T O Expectations Grade 6 Content Standard A: Mathematical facts, concepts, principles, and theories Numeration: Understand
More informationTennessee Senior Bridge Mathematics
A Correlation of to the Mathematics Standards Approved July 30, 2010 Bid Category 13-130-10 A Correlation of, to the Mathematics Standards Mathematics Standards I. Ways of Looking: Revisiting Concepts
More informationNonuniform multi level crossing for signal reconstruction
6 Nonuniform multi level crossing for signal reconstruction 6.1 Introduction In recent years, there has been considerable interest in level crossing algorithms for sampling continuous time signals. Driven
More informationHuman Vision and Human-Computer Interaction. Much content from Jeff Johnson, UI Wizards, Inc.
Human Vision and Human-Computer Interaction Much content from Jeff Johnson, UI Wizards, Inc. are these guidelines grounded in perceptual psychology and how can we apply them intelligently? Mach bands:
More information17. Symmetries. Thus, the example above corresponds to the matrix: We shall now look at how permutations relate to trees.
7 Symmetries 7 Permutations A permutation of a set is a reordering of its elements Another way to look at it is as a function Φ that takes as its argument a set of natural numbers of the form {, 2,, n}
More informationComplex Mathematics Tools in Urban Studies
Complex Mathematics Tools in Urban Studies Jose Oliver, University of Alicante, Spain Taras Agryzcov, University of Alicante, Spain Leandro Tortosa, University of Alicante, Spain Jose Vicent, University
More informationCOS 402 Machine Learning and Artificial Intelligence Fall Lecture 1: Intro
COS 402 Machine Learning and Artificial Intelligence Fall 2016 Lecture 1: Intro Sanjeev Arora Elad Hazan Today s Agenda Defining intelligence and AI state-of-the-art, goals Course outline AI by introspection
More informationThe Behavior Evolving Model and Application of Virtual Robots
The Behavior Evolving Model and Application of Virtual Robots Suchul Hwang Kyungdal Cho V. Scott Gordon Inha Tech. College Inha Tech College CSUS, Sacramento 253 Yonghyundong Namku 253 Yonghyundong Namku
More informationUsing Neural Network and Monte-Carlo Tree Search to Play the Game TEN
Using Neural Network and Monte-Carlo Tree Search to Play the Game TEN Weijie Chen Fall 2017 Weijie Chen Page 1 of 7 1. INTRODUCTION Game TEN The traditional game Tic-Tac-Toe enjoys people s favor. Moreover,
More informationOBJECTIVE OF THE BOOK ORGANIZATION OF THE BOOK
xv Preface Advancement in technology leads to wide spread use of mounting cameras to capture video imagery. Such surveillance cameras are predominant in commercial institutions through recording the cameras
More informationRELEASING APERTURE FILTER CONSTRAINTS
RELEASING APERTURE FILTER CONSTRAINTS Jakub Chlapinski 1, Stephen Marshall 2 1 Department of Microelectronics and Computer Science, Technical University of Lodz, ul. Zeromskiego 116, 90-924 Lodz, Poland
More informationTEMPORAL DIFFERENCE LEARNING IN CHINESE CHESS
TEMPORAL DIFFERENCE LEARNING IN CHINESE CHESS Thong B. Trinh, Anwer S. Bashi, Nikhil Deshpande Department of Electrical Engineering University of New Orleans New Orleans, LA 70148 Tel: (504) 280-7383 Fax:
More informationGREATER CLARK COUNTY SCHOOLS PACING GUIDE. Grade 4 Mathematics GREATER CLARK COUNTY SCHOOLS
GREATER CLARK COUNTY SCHOOLS PACING GUIDE Grade 4 Mathematics 2014-2015 GREATER CLARK COUNTY SCHOOLS ANNUAL PACING GUIDE Learning Old Format New Format Q1LC1 4.NBT.1, 4.NBT.2, 4.NBT.3, (4.1.1, 4.1.2,
More informationCOMPLEXITY MEASURES OF DESIGN DRAWINGS AND THEIR APPLICATIONS
The Ninth International Conference on Computing in Civil and Building Engineering April 3-5, 2002, Taipei, Taiwan COMPLEXITY MEASURES OF DESIGN DRAWINGS AND THEIR APPLICATIONS J. S. Gero and V. Kazakov
More informationCSE 573 Problem Set 1. Answers on 10/17/08
CSE 573 Problem Set. Answers on 0/7/08 Please work on this problem set individually. (Subsequent problem sets may allow group discussion. If any problem doesn t contain enough information for you to answer
More informationUsing Deep Learning for Sentiment Analysis and Opinion Mining
Using Deep Learning for Sentiment Analysis and Opinion Mining Gauging opinions is faster and more accurate. Abstract How does a computer analyze sentiment? How does a computer determine if a comment or
More informationCitation for published version (APA): Nutma, T. A. (2010). Kac-Moody Symmetries and Gauged Supergravity Groningen: s.n.
University of Groningen Kac-Moody Symmetries and Gauged Supergravity Nutma, Teake IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF) if you wish to cite from it. Please
More information10/5/2015. Constraint Satisfaction Problems. Example: Cryptarithmetic. Example: Map-coloring. Example: Map-coloring. Constraint Satisfaction Problems
0/5/05 Constraint Satisfaction Problems Constraint Satisfaction Problems AIMA: Chapter 6 A CSP consists of: Finite set of X, X,, X n Nonempty domain of possible values for each variable D, D, D n where
More informationMath + 4 (Red) SEMESTER 1. { Pg. 1 } Unit 1: Whole Number Sense. Unit 2: Whole Number Operations. Unit 3: Applications of Operations
Math + 4 (Red) This research-based course focuses on computational fluency, conceptual understanding, and problem-solving. The engaging course features new graphics, learning tools, and games; adaptive
More informationA Novel Fuzzy Neural Network Based Distance Relaying Scheme
902 IEEE TRANSACTIONS ON POWER DELIVERY, VOL. 15, NO. 3, JULY 2000 A Novel Fuzzy Neural Network Based Distance Relaying Scheme P. K. Dash, A. K. Pradhan, and G. Panda Abstract This paper presents a new
More informationThe emergence of choice: Decision-making and strategic thinking through analogies
The emergence of choice: Decision-making and strategic thinking through analogies Alexandre Linhares 1, 2 1. EBAPE / Getulio Vargas Foundation, linhares@clubofrome.org.br Praia de Botafogo 190 office 509,
More informationChapter 17. Shape-Based Operations
Chapter 17 Shape-Based Operations An shape-based operation identifies or acts on groups of pixels that belong to the same object or image component. We have already seen how components may be identified
More informationAngle Measure and Plane Figures
Grade 4 Module 4 Angle Measure and Plane Figures OVERVIEW This module introduces points, lines, line segments, rays, and angles, as well as the relationships between them. Students construct, recognize,
More informationSolving Problems by Searching
Solving Problems by Searching Berlin Chen 2005 Reference: 1. S. Russell and P. Norvig. Artificial Intelligence: A Modern Approach. Chapter 3 AI - Berlin Chen 1 Introduction Problem-Solving Agents vs. Reflex
More informationA Numerical Approach to Understanding Oscillator Neural Networks
A Numerical Approach to Understanding Oscillator Neural Networks Natalie Klein Mentored by Jon Wilkins Networks of coupled oscillators are a form of dynamical network originally inspired by various biological
More informationTechnology Engineering and Design Education
Technology Engineering and Design Education Grade: Grade 6-8 Course: Technological Systems NCCTE.TE02 - Technological Systems NCCTE.TE02.01.00 - Technological Systems: How They Work NCCTE.TE02.02.00 -
More informationPermutation Groups. Definition and Notation
5 Permutation Groups Wigner s discovery about the electron permutation group was just the beginning. He and others found many similar applications and nowadays group theoretical methods especially those
More informationArtificial Intelligence. Shobhanjana Kalita Dept. of Computer Science & Engineering Tezpur University
Artificial Intelligence Shobhanjana Kalita Dept. of Computer Science & Engineering Tezpur University What is AI? What is Intelligence? The ability to acquire and apply knowledge and skills (definition
More informationROBOT VISION. Dr.M.Madhavi, MED, MVSREC
ROBOT VISION Dr.M.Madhavi, MED, MVSREC Robotic vision may be defined as the process of acquiring and extracting information from images of 3-D world. Robotic vision is primarily targeted at manipulation
More informationUser Type Identification in Virtual Worlds
User Type Identification in Virtual Worlds Ruck Thawonmas, Ji-Young Ho, and Yoshitaka Matsumoto Introduction In this chapter, we discuss an approach for identification of user types in virtual worlds.
More informationCOMP219: COMP219: Artificial Intelligence Artificial Intelligence Dr. Annabel Latham Lecture 12: Game Playing Overview Games and Search
COMP19: Artificial Intelligence COMP19: Artificial Intelligence Dr. Annabel Latham Room.05 Ashton Building Department of Computer Science University of Liverpool Lecture 1: Game Playing 1 Overview Last
More informationVisual Arts What Every Child Should Know
3rd Grade The arts have always served as the distinctive vehicle for discovering who we are. Providing ways of thinking as disciplined as science or math and as disparate as philosophy or literature, the
More informationFive-In-Row with Local Evaluation and Beam Search
Five-In-Row with Local Evaluation and Beam Search Jiun-Hung Chen and Adrienne X. Wang jhchen@cs axwang@cs Abstract This report provides a brief overview of the game of five-in-row, also known as Go-Moku,
More informationAgent Smith: An Application of Neural Networks to Directing Intelligent Agents in a Game Environment
Agent Smith: An Application of Neural Networks to Directing Intelligent Agents in a Game Environment Jonathan Wolf Tyler Haugen Dr. Antonette Logar South Dakota School of Mines and Technology Math and
More informationThe Discrete Fourier Transform. Claudia Feregrino-Uribe, Alicia Morales-Reyes Original material: Dr. René Cumplido
The Discrete Fourier Transform Claudia Feregrino-Uribe, Alicia Morales-Reyes Original material: Dr. René Cumplido CCC-INAOE Autumn 2015 The Discrete Fourier Transform Fourier analysis is a family of mathematical
More informationarxiv: v1 [cs.lg] 2 Jan 2018
Deep Learning for Identifying Potential Conceptual Shifts for Co-creative Drawing arxiv:1801.00723v1 [cs.lg] 2 Jan 2018 Pegah Karimi pkarimi@uncc.edu Kazjon Grace The University of Sydney Sydney, NSW 2006
More informationChapter 1: Positional Play
Chapter 1: Positional Play Positional play is the Bogey-man of many chess players, who feel that it is beyond their understanding. However, this subject isn t really hard to grasp if you break it down.
More informationPOSITIONAL EVALUATION
POSITIONAL EVALUATION In this lesson, we present the evaluation of the position, the most important element of chess strategy. The evaluation of the positional factors gives us a correct and complete picture
More informationProblem of the Month What s Your Angle?
Problem of the Month What s Your Angle? Overview: In the Problem of the Month What s Your Angle?, students use geometric reasoning to solve problems involving two dimensional objects and angle measurements.
More informationTime And Resource Characteristics Of Radical New Product Development (NPD) Projects And their Dynamic Control. Introduction. Problem Description.
Time And Resource Characteristics Of Radical New Product Development (NPD) Projects And their Dynamic Control Track: Product and Process Design In many industries the innovation rate increased while the
More informationarxiv: v1 [cs.cc] 21 Jun 2017
Solving the Rubik s Cube Optimally is NP-complete Erik D. Demaine Sarah Eisenstat Mikhail Rudoy arxiv:1706.06708v1 [cs.cc] 21 Jun 2017 Abstract In this paper, we prove that optimally solving an n n n Rubik
More informationConceptual Metaphors for Explaining Search Engines
Conceptual Metaphors for Explaining Search Engines David G. Hendry and Efthimis N. Efthimiadis Information School University of Washington, Seattle, WA 98195 {dhendry, efthimis}@u.washington.edu ABSTRACT
More informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 20. Combinatorial Optimization: Introduction and Hill-Climbing Malte Helmert Universität Basel April 8, 2016 Combinatorial Optimization Introduction previous chapters:
More information(Refer Slide Time: 3:11)
Digital Communication. Professor Surendra Prasad. Department of Electrical Engineering. Indian Institute of Technology, Delhi. Lecture-2. Digital Representation of Analog Signals: Delta Modulation. Professor:
More informationSome Fine Combinatorics
Some Fine Combinatorics David P. Little Department of Mathematics Penn State University University Park, PA 16802 Email: dlittle@math.psu.edu August 3, 2009 Dedicated to George Andrews on the occasion
More informationGREATER CLARK COUNTY SCHOOLS PACING GUIDE. Algebra I MATHEMATICS G R E A T E R C L A R K C O U N T Y S C H O O L S
GREATER CLARK COUNTY SCHOOLS PACING GUIDE Algebra I MATHEMATICS 2014-2015 G R E A T E R C L A R K C O U N T Y S C H O O L S ANNUAL PACING GUIDE Quarter/Learning Check Days (Approx) Q1/LC1 11 Concept/Skill
More informationOpponent Models and Knowledge Symmetry in Game-Tree Search
Opponent Models and Knowledge Symmetry in Game-Tree Search Jeroen Donkers Institute for Knowlegde and Agent Technology Universiteit Maastricht, The Netherlands donkers@cs.unimaas.nl Abstract In this paper
More informationImpediments to designing and developing for accessibility, accommodation and high quality interaction
Impediments to designing and developing for accessibility, accommodation and high quality interaction D. Akoumianakis and C. Stephanidis Institute of Computer Science Foundation for Research and Technology-Hellas
More informationTraining a Back-Propagation Network with Temporal Difference Learning and a database for the board game Pente
Training a Back-Propagation Network with Temporal Difference Learning and a database for the board game Pente Valentijn Muijrers 3275183 Valentijn.Muijrers@phil.uu.nl Supervisor: Gerard Vreeswijk 7,5 ECTS
More informationConversion Masters in IT (MIT) AI as Representation and Search. (Representation and Search Strategies) Lecture 002. Sandro Spina
Conversion Masters in IT (MIT) AI as Representation and Search (Representation and Search Strategies) Lecture 002 Sandro Spina Physical Symbol System Hypothesis Intelligent Activity is achieved through
More informationA computer model of chess memory 1
Gobet, F. (1993). A computer model of chess memory. Proceedings of 15th Annual Meeting of the Cognitive Science Society, p. 463-468. Hillsdale, NJ: Erlbaum. A computer model of chess memory 1 Fernand Gobet
More informationThe study of human populations involves working not PART 2. Cemetery Investigation: An Exercise in Simple Statistics POPULATIONS
PART 2 POPULATIONS Cemetery Investigation: An Exercise in Simple Statistics 4 When you have completed this exercise, you will be able to: 1. Work effectively with data that must be organized in a useful
More informationMathematics Expectations Page 1 Grade 04
Mathematics Expectations Page 1 Problem Solving Mathematical Process Expectations 4m1 develop, select, and apply problem-solving strategies as they pose and solve problems and conduct investigations, to
More informationCharacterization of LF and LMA signal of Wire Rope Tester
Volume 8, No. 5, May June 2017 International Journal of Advanced Research in Computer Science RESEARCH PAPER Available Online at www.ijarcs.info ISSN No. 0976-5697 Characterization of LF and LMA signal
More informationGame Theory and Randomized Algorithms
Game Theory and Randomized Algorithms Guy Aridor Game theory is a set of tools that allow us to understand how decisionmakers interact with each other. It has practical applications in economics, international
More informationArtificial Intelligence
Artificial Intelligence CS482, CS682, MW 1 2:15, SEM 201, MS 227 Prerequisites: 302, 365 Instructor: Sushil Louis, sushil@cse.unr.edu, http://www.cse.unr.edu/~sushil Non-classical search - Path does not
More informationON THE GENERATION AND UTILIZATION OF USER RELATED INFORMATION IN DESIGN STUDIO SETTING: TOWARDS A FRAMEWORK AND A MODEL
ON THE GENERATION AND UTILIZATION OF USER RELATED INFORMATION IN DESIGN STUDIO SETTING: TOWARDS A FRAMEWORK AND A MODEL Meltem Özten Anay¹ ¹Department of Architecture, Middle East Technical University,
More informationRevised Elko County School District 2 nd Grade Math Learning Targets
Elko County School District 2 nd Grade Math Learning Targets Content Standard 1.0 Students will accurately calculate and use estimation techniques, number relationships, operation rules, and algorithms;
More informationComplex DNA and Good Genes for Snakes
458 Int'l Conf. Artificial Intelligence ICAI'15 Complex DNA and Good Genes for Snakes Md. Shahnawaz Khan 1 and Walter D. Potter 2 1,2 Institute of Artificial Intelligence, University of Georgia, Athens,
More informationAPPLICATION OF COMPUTER VISION FOR DETERMINATION OF SYMMETRICAL OBJECT POSITION IN THREE DIMENSIONAL SPACE
APPLICATION OF COMPUTER VISION FOR DETERMINATION OF SYMMETRICAL OBJECT POSITION IN THREE DIMENSIONAL SPACE Najirah Umar 1 1 Jurusan Teknik Informatika, STMIK Handayani Makassar Email : najirah_stmikh@yahoo.com
More informationDesign Rationale as an Enabling Factor for Concurrent Process Engineering
612 Rafael Batres, Atsushi Aoyama, and Yuji NAKA Design Rationale as an Enabling Factor for Concurrent Process Engineering Rafael Batres, Atsushi Aoyama, and Yuji NAKA Tokyo Institute of Technology, Yokohama
More informationCHAPTER 6 ANFIS BASED NEURO-FUZZY CONTROLLER
143 CHAPTER 6 ANFIS BASED NEURO-FUZZY CONTROLLER 6.1 INTRODUCTION The quality of generated electricity in power system is dependent on the system output, which has to be of constant frequency and must
More informationArgumentative Interactions in Online Asynchronous Communication
Argumentative Interactions in Online Asynchronous Communication Evelina De Nardis, University of Roma Tre, Doctoral School in Pedagogy and Social Service, Department of Educational Science evedenardis@yahoo.it
More informationHow can Physics Inform Deep Learning Methods in Scientific Problems:
How can Physics Inform Deep Learning Methods in Scientific Problems: Recent Progress and Future Prospects Anuj Karpatne Post-Doctoral Associate, University of Minnesota karpa009@umn.edu http://www.cs.umn.edu/~anuj
More informationMaking Representations: From Sensation to Perception
Making Representations: From Sensation to Perception Mary-Anne Williams Innovation and Enterprise Research Lab University of Technology, Sydney Australia Overview Understanding Cognition Understanding
More informationENHANCED HUMAN-AGENT INTERACTION: AUGMENTING INTERACTION MODELS WITH EMBODIED AGENTS BY SERAFIN BENTO. MASTER OF SCIENCE in INFORMATION SYSTEMS
BY SERAFIN BENTO MASTER OF SCIENCE in INFORMATION SYSTEMS Edmonton, Alberta September, 2015 ABSTRACT The popularity of software agents demands for more comprehensive HAI design processes. The outcome of
More informationLearning Behaviors for Environment Modeling by Genetic Algorithm
Learning Behaviors for Environment Modeling by Genetic Algorithm Seiji Yamada Department of Computational Intelligence and Systems Science Interdisciplinary Graduate School of Science and Engineering Tokyo
More informationHumanizing Parametricism
Humanizing Parametricism Devan Castellano Doctoral Student, University of Wisconsin Madison, School of Human Ecology, Design Studies. As we increase the complexity and correlations of variables that are
More informationPREDICTING ASSEMBLY QUALITY OF COMPLEX STRUCTURES USING DATA MINING Predicting with Decision Tree Algorithm
PREDICTING ASSEMBLY QUALITY OF COMPLEX STRUCTURES USING DATA MINING Predicting with Decision Tree Algorithm Ekaterina S. Ponomareva, Kesheng Wang, Terje K. Lien Department of Production and Quality Engieering,
More information4.5 Fractional Delay Operations with Allpass Filters
158 Discrete-Time Modeling of Acoustic Tubes Using Fractional Delay Filters 4.5 Fractional Delay Operations with Allpass Filters The previous sections of this chapter have concentrated on the FIR implementation
More informationTHE PRINCIPLE OF PRESSURE IN CHESS. Deniz Yuret. MIT Articial Intelligence Laboratory. 545 Technology Square, Rm:825. Cambridge, MA 02139, USA
THE PRINCIPLE OF PRESSURE IN CHESS Deniz Yuret MIT Articial Intelligence Laboratory 545 Technology Square, Rm:825 Cambridge, MA 02139, USA email: deniz@mit.edu Abstract This paper presents a new algorithm,
More informationSegmentation using Saturation Thresholding and its Application in Content-Based Retrieval of Images
Segmentation using Saturation Thresholding and its Application in Content-Based Retrieval of Images A. Vadivel 1, M. Mohan 1, Shamik Sural 2 and A.K.Majumdar 1 1 Department of Computer Science and Engineering,
More information