Download DOT graph - Linguistic Computing Laboratory

digraph G {
"action theory" [fillcolor="green"];
"theory" [fillcolor="lime"];
"event" [fillcolor="lime"];
"adjacency list" [fillcolor="green"];
"data structure" [fillcolor="lime"];
"representation" [fillcolor="lime"];
"knowledge" [fillcolor="lime"];
"adjacency matrix" [fillcolor="green"];
"representation of a graph" [fillcolor="blue"];
"alpha-beta search" [fillcolor="green"];
"artificial intelligence" [fillcolor="green"];
"computer science" [fillcolor="green"];
"system" [fillcolor="lime"];
"abstraction" [fillcolor="lime"];
"algorithm" [fillcolor="lime"];
"science" [fillcolor="lime"];
"put-up-or-shut-up discipline" [fillcolor="blue"];
"associative memory" [fillcolor="green"];
"property of the soar" [fillcolor="blue"];
"property" [fillcolor="lime"];
"bayesian network" [fillcolor="green"];
"graph" [fillcolor="blue"];
"intuitive graphical representation" [fillcolor="blue"];
"compact representation of joint probability function"
[fillcolor="blue"];
"representation of the probabilistic relationship"
[fillcolor="blue"];
"graph-based model" [fillcolor="blue"];
"model" [fillcolor="lime"];
"graph-based model of joint multivariate probability distribution"
[fillcolor="blue"];
"beam search" [fillcolor="green"];
"heuristic search algorithm" [fillcolor="blue"];
"belief propagation" [fillcolor="green"];
"probability inference algorithm" [fillcolor="blue"];
"best-first search" [fillcolor="green"];
"search algorithm" [fillcolor="green"];
"binary classification" [fillcolor="green"];
"binary constraint" [fillcolor="green"];
"constraint" [fillcolor="blue"];
"rule" [fillcolor="blue"];
"binary heap" [fillcolor="green"];
"heap" [fillcolor="blue"];
"specialized tree-based data structure" [fillcolor="blue"];
"heap data structure" [fillcolor="blue"];
"binary search" [fillcolor="green"];
"conquer search algorithm" [fillcolor="blue"];
"boolean function" [fillcolor="green"];
"function" [fillcolor="blue"];
"boolean expression" [fillcolor="blue"];
"expression" [fillcolor="lime"];
"communication" [fillcolor="lime"];
"boolean logic" [fillcolor="green"];
"logic" [fillcolor="blue"];
"processing language" [fillcolor="blue"];
"language" [fillcolor="lime"];
"binary logic system" [fillcolor="blue"];
"boolean variable" [fillcolor="green"];
"variable" [fillcolor="blue"];
"facility" [fillcolor="blue"];
"boyer-moore algorithm" [fillcolor="green"];
"breadth first search" [fillcolor="green"];
"classification accuracy" [fillcolor="green"];
"ability" [fillcolor="lime"];
"quality" [fillcolor="lime"];
"combinatorial auction" [fillcolor="green"];
"auction" [fillcolor="blue"];
"mechanism" [fillcolor="blue"];
"computational complexity" [fillcolor="green"];
"processing" [fillcolor="blue"];
"computational complexity theory" [fillcolor="green"];
"computation" [fillcolor="blue"];
"algorithmic process" [fillcolor="blue"];
"computer vision" [fillcolor="green"];
"extraction" [fillcolor="blue"];
"technology of machine" [fillcolor="blue"];
"conditional probability" [fillcolor="green"];
"probability" [fillcolor="blue"];
"imperfect measure of associative strength" [fillcolor="blue"];
"conditional random field" [fillcolor="green"];
"logistic regression" [fillcolor="green"];
"multivariate analysis method of marketing information"
[fillcolor="blue"];
"machine learning technique" [fillcolor="blue"];
"discriminative undirected probabilistic graphical model"
[fillcolor="blue"];
"consistency checker" [fillcolor="green"];
"program" [fillcolor="blue"];
"service" [fillcolor="blue"];
"constraint network" [fillcolor="green"];
"node" [fillcolor="blue"];
"point" [fillcolor="blue"];
"constraint propagation" [fillcolor="green"];
"iterative process" [fillcolor="blue"];
"roster design method" [fillcolor="blue"];
"constraint satisfaction" [fillcolor="green"];
"intelligence" [fillcolor="blue"];
"convex hull" [fillcolor="green"];
"polygon" [fillcolor="blue"];
"convex polygon" [fillcolor="green"];
"opposite" [fillcolor="blue"];
"relation of direct opposition" [fillcolor="blue"];
"cosine similarity" [fillcolor="green"];
"measure of similarity" [fillcolor="blue"];
"cross validation" [fillcolor="green"];
"model evaluation method" [fillcolor="blue"];
"cryptography" [fillcolor="green"];
"numerical algorithm" [fillcolor="blue"];
"code" [fillcolor="lime"];
"data matrix" [fillcolor="green"];
"data mining" [fillcolor="green"];
"automated process" [fillcolor="blue"];
"non-trivial process" [fillcolor="blue"];
"nontrivial automated process" [fillcolor="blue"];
"decision problem" [fillcolor="green"];
"question" [fillcolor="blue"];
"decision tree" [fillcolor="green"];
"graphical model" [fillcolor="green"];
"tree" [fillcolor="blue"];
"decomposition tree" [fillcolor="green"];
"depth-first search" [fillcolor="green"];
"derivation tree" [fillcolor="green"];
"planar representation" [fillcolor="blue"];
"description logic" [fillcolor="green"];
"formalism for knowledge representation" [fillcolor="blue"];
"predicate logic" [fillcolor="blue"];
"deduction system" [fillcolor="blue"];
"deterministic finite automaton" [fillcolor="green"];
"model of a machine" [fillcolor="blue"];
"differential equation" [fillcolor="green"];
"vector field" [fillcolor="blue"];
"equation" [fillcolor="blue"];
"statement" [fillcolor="blue"];
"dimensionality reduction" [fillcolor="green"];
"discriminant analysis" [fillcolor="green"];
"discriminative model" [fillcolor="green"];
"probability model" [fillcolor="blue"];
"domain knowledge" [fillcolor="green"];
"dynamic programming" [fillcolor="green"];
"optimization technique" [fillcolor="blue"];
"eigenvalue" [fillcolor="green"];
"em algorithm" [fillcolor="green"];
"forgetful em algorithm" [fillcolor="blue"];
"iterative procedure" [fillcolor="blue"];
"two-step process" [fillcolor="blue"];
"equivalence class" [fillcolor="green"];
"equality" [fillcolor="blue"];
"equivalence" [fillcolor="blue"];
"equivalence relation" [fillcolor="green"];
"relation" [fillcolor="lime"];
"euclidean space" [fillcolor="green"];
"euclidean plane" [fillcolor="blue"];
"euclidean geometry" [fillcolor="blue"];
"face recognition" [fillcolor="green"];
"desktop access control software" [fillcolor="blue"];
"feature extraction" [fillcolor="green"];
"adaptability" [fillcolor="blue"];
"feature selection" [fillcolor="green"];
"selection" [fillcolor="blue"];
"feature space" [fillcolor="green"];
"space" [fillcolor="blue"];
"fibonacci number" [fillcolor="green"];
"number" [fillcolor="blue"];
"series" [fillcolor="blue"];
"finite state machine" [fillcolor="green"];
"model of a synchronous order machine" [fillcolor="blue"];
"first-order logic" [fillcolor="green"];
"first-order predicate calculus" [fillcolor="blue"];
"flow network" [fillcolor="green"];
"free variable" [fillcolor="green"];
"game theory" [fillcolor="green"];
"mathematics" [fillcolor="blue"];
"theory of rational behavior" [fillcolor="blue"];
"game tree" [fillcolor="green"];
"gaussian process" [fillcolor="green"];
"stochastic process" [fillcolor="blue"];
"nonparametric model" [fillcolor="blue"];
"generative model" [fillcolor="green"];
"gene expression pattern" [fillcolor="green"];
"network" [fillcolor="blue"];
"digraph" [fillcolor="blue"];
"gradient descent" [fillcolor="green"];
"first-order optimization algorithm" [fillcolor="blue"];
"graph coloring" [fillcolor="green"];
"register allocation algorithm" [fillcolor="blue"];
"factor standard technique" [fillcolor="blue"];
"assignment" [fillcolor="blue"];
"graph mining" [fillcolor="green"];
"pattern" [fillcolor="blue"];
"probabilistic model" [fillcolor="green"];
"greedy algorithm" [fillcolor="green"];
"approximate algorithm" [fillcolor="blue"];
"optimization algorithm" [fillcolor="blue"];
"hash function" [fillcolor="green"];
"composition" [fillcolor="blue"];
"well-defined procedure" [fillcolor="blue"];
"hash table" [fillcolor="green"];
"heap sort" [fillcolor="green"];
"sorting information" [fillcolor="blue"];
"heuristic search" [fillcolor="green"];
"search technique" [fillcolor="blue"];
"horn clause" [fillcolor="green"];
"clause" [fillcolor="blue"];
"htn planning" [fillcolor="green"];
"planning methodology" [fillcolor="blue"];
"hybrid model" [fillcolor="green"];
"image annotation" [fillcolor="green"];
"image retrieval" [fillcolor="green"];
"wider domain" [fillcolor="blue"];
"technology of the inquiry" [fillcolor="blue"];
"inference rule" [fillcolor="green"];
"conditional statement" [fillcolor="blue"];
"information extraction" [fillcolor="green"];
"information retrieval" [fillcolor="green"];
"data mining technology" [fillcolor="blue"];
"text processing" [fillcolor="blue"];
"operation for programming language" [fillcolor="blue"];
"language processing" [fillcolor="blue"];
"writing" [fillcolor="blue"];
"information processing" [fillcolor="green"];
"searching" [fillcolor="blue"];
"search" [fillcolor="blue"];
"search approach" [fillcolor="blue"];
"integer factorization" [fillcolor="green"];
"interaction graph" [fillcolor="green"];
"oriented graph" [fillcolor="blue"];
"kl divergence" [fillcolor="green"];
"asymmetric divergence measure" [fillcolor="blue"];
"linear equation" [fillcolor="green"];
"algebraic representation" [fillcolor="blue"];
"linear programming" [fillcolor="green"];
"computational method" [fillcolor="blue"];
"local search" [fillcolor="green"];
"metaheuristic" [fillcolor="blue"];
"heuristic method" [fillcolor="blue"];
"logic program" [fillcolor="green"];
"atom" [fillcolor="blue"];
"logic programming" [fillcolor="green"];
"computer program" [fillcolor="blue"];
"discriminitive probabilistic classification model"
[fillcolor="blue"];
"loss function" [fillcolor="green"];
"machine learning" [fillcolor="green"];
"machine translation" [fillcolor="green"];
"translation" [fillcolor="blue"];
"computer software" [fillcolor="blue"];
"language technology" [fillcolor="blue"];
"markov model" [fillcolor="green"];
"stochastic model" [fillcolor="blue"];
"markov network" [fillcolor="green"];
"undirected graph" [fillcolor="green"];
"matrix multiplication" [fillcolor="green"];
"binary operation" [fillcolor="blue"];
"maximum likelihood" [fillcolor="green"];
"mesh generation" [fillcolor="green"];
"mixture model" [fillcolor="green"];
"distribution" [fillcolor="blue"];
"modal logic" [fillcolor="green"];
"law" [fillcolor="blue"];
"operation" [fillcolor="blue"];
"modal operator" [fillcolor="green"];
"operator" [fillcolor="blue"];
"inference" [fillcolor="blue"];
"reasoning" [fillcolor="blue"];
"model checking" [fillcolor="green"];
"automated verification method" [fillcolor="blue"];
"automated technique" [fillcolor="blue"];
"algorithmic technique" [fillcolor="blue"];
"verification technique" [fillcolor="blue"];
"natural language processing" [fillcolor="green"];
"linguistics" [fillcolor="blue"];
"literature" [fillcolor="blue"];
"non-euclidean geometry" [fillcolor="green"];
"geometry" [fillcolor="blue"];
"line" [fillcolor="blue"];
"normal distribution" [fillcolor="green"];
"probability distribution" [fillcolor="green"];
"np-completeness" [fillcolor="green"];
"object recognition" [fillcolor="green"];
"brain" [fillcolor="blue"];
"devices ability" [fillcolor="blue"];
"optimal solution" [fillcolor="green"];
"pagerank" [fillcolor="green"];
"link analysis algorithm" [fillcolor="blue"];
"ranking system" [fillcolor="blue"];
"measure of online influence" [fillcolor="blue"];
"pattern matching" [fillcolor="green"];
"cpu intensive process" [fillcolor="blue"];
"pattern recognition" [fillcolor="green"];
"innate ability" [fillcolor="blue"];
"innate ability of animal" [fillcolor="blue"];
"polynomial-time algorithm" [fillcolor="green"];
"posterior probability" [fillcolor="green"];
"propositional logic" [fillcolor="green"];
"philosophy" [fillcolor="blue"];
"belief" [fillcolor="blue"];
"qbf solver" [fillcolor="green"];
"software program" [fillcolor="blue"];
"quick sort" [fillcolor="green"];
"coolest algorithm" [fillcolor="blue"];
"in-place sort algorithm" [fillcolor="blue"];
"divide-and-conquer sorting algorithm" [fillcolor="blue"];
"random field" [fillcolor="green"];
"random graph" [fillcolor="green"];
"random variable" [fillcolor="green"];
"random walk" [fillcolor="green"];
"recommender system" [fillcolor="green"];
"software tool" [fillcolor="blue"];
"regular expression" [fillcolor="green"];
"formula" [fillcolor="blue"];
"reinforcement learning" [fillcolor="green"];
"simulation-based technique" [fillcolor="blue"];
"simulation-based method" [fillcolor="blue"];
"iterative approach" [fillcolor="blue"];
"self-learning algorithm" [fillcolor="blue"];
"rsa encryption" [fillcolor="green"];
"public-key encryption algorithm" [fillcolor="blue"];
"encryption" [fillcolor="blue"];
"deterministic encryption algorithm" [fillcolor="blue"];
"satisfiability problem" [fillcolor="green"];
"search method" [fillcolor="green"];
"search tree" [fillcolor="green"];
"tree data structure" [fillcolor="blue"];
"semantic space" [fillcolor="green"];
"indefinite domain of possible expression" [fillcolor="blue"];
"semantic web" [fillcolor="green"];
"web" [fillcolor="blue"];
"generic top-level domain" [fillcolor="blue"];
"semi-supervised learning" [fillcolor="green"];
"sequential search" [fillcolor="green"];
"simplest approach" [fillcolor="blue"];
"service composition" [fillcolor="green"];
"sketch recognition" [fillcolor="green"];
"recognition" [fillcolor="blue"];
"social network" [fillcolor="green"];
"structure" [fillcolor="blue"];
"spatial reasoning" [fillcolor="green"];
"standard deviation" [fillcolor="green"];
"measure of deviation" [fillcolor="blue"];
"state diagram" [fillcolor="green"];
"diagram" [fillcolor="blue"];
"string matching" [fillcolor="green"];
"support vector" [fillcolor="green"];
"vector" [fillcolor="blue"];
"temporal logic" [fillcolor="green"];
"time complexity" [fillcolor="green"];
"complexity" [fillcolor="blue"];
"measure of the amount" [fillcolor="blue"];
"transition function" [fillcolor="green"];
"tree search" [fillcolor="green"];
"user interface" [fillcolor="green"];
"interface" [fillcolor="blue"];
"utility function" [fillcolor="green"];
"web mining" [fillcolor="green"];
"web service" [fillcolor="green"];
"word sense disambiguation" [fillcolor="green"];
"relatively new science" [fillcolor="blue"];
"predominant programming technique" [fillcolor="blue"];
"distance" [fillcolor="blue"];
"kernel method" [fillcolor="green"];
"development" [fillcolor="blue"];
"computer-based statistical procedure" [fillcolor="blue"];
"design" [fillcolor="blue"];
"analysis" [fillcolor="blue"];
"search engine" [fillcolor="green"];
"internet search engine" [fillcolor="blue"];
"non-memory-based method" [fillcolor="blue"];
"parametric distribution model" [fillcolor="blue"];
"topic model" [fillcolor="green"];
"hierarchical bayesian model" [fillcolor="blue"];
"phenomenon" [fillcolor="lime"];
"support vector machine" [fillcolor="green"];
"neural network" [fillcolor="blue"];
"discriminative probabilistic model" [fillcolor="blue"];
"motion" [fillcolor="blue"];
"halting problem" [fillcolor="green"];
"incomplete method" [fillcolor="blue"];
"information retrieval system" [fillcolor="blue"];
"engineering science" [fillcolor="blue"];
"data processing" [fillcolor="blue"];
"data analysis" [fillcolor="blue"];
"face" [fillcolor="blue"];
"contorted facial expression" [fillcolor="blue"];
"theory of competition" [fillcolor="blue"];
"computer language" [fillcolor="blue"];
"necessity" [fillcolor="blue"];
"information science" [fillcolor="blue"];
"approximation algorithm" [fillcolor="green"];
"array" [fillcolor="green"];
"cost function" [fillcolor="green"];
"data set" [fillcolor="green"];
"value" [fillcolor="blue"];
"depth first search" [fillcolor="green"];
"search strategy" [fillcolor="blue"];
"dijkstra's algorithm" [fillcolor="green"];
"optimal greedy algorithm" [fillcolor="blue"];
"directed acyclic graph" [fillcolor="green"];
"directed graph" [fillcolor="green"];
"finite element method" [fillcolor="green"];
"computer simulation" [fillcolor="blue"];
"kruskal's algorithm" [fillcolor="green"];
"labeled datum" [fillcolor="green"];
"data item" [fillcolor="blue"];
"language model" [fillcolor="green"];
"latent variable" [fillcolor="green"];
"learning algorithm" [fillcolor="green"];
"minimum spanning tree" [fillcolor="green"];
"objective function" [fillcolor="green"];
"reduction algorithm" [fillcolor="green"];
"regression model" [fillcolor="green"];
"computer site-selection model" [fillcolor="blue"];
"sorting algorithm" [fillcolor="green"];
"intelligence model" [fillcolor="blue"];
"representation of datum" [fillcolor="blue"];
"image" [fillcolor="blue"];
"iconic mental representation" [fillcolor="blue"];
"chart representation" [fillcolor="blue"];
"computer programming system" [fillcolor="blue"];
"representation of the relation" [fillcolor="blue"];
"amount" [fillcolor="blue"];
"quantity of money" [fillcolor="blue"];
"act of help" [fillcolor="blue"];
"system of thing" [fillcolor="blue"];
"communication system" [fillcolor="blue"];
"graphical representation" [fillcolor="blue"];
"geographic property" [fillcolor="blue"];
"derivation" [fillcolor="blue"];
"symbol" [fillcolor="blue"];
"representation of a substance" [fillcolor="blue"];
"computer architecture" [fillcolor="blue"];
"numerical quantity" [fillcolor="blue"];
"web search engine" [fillcolor="blue"];
"representation of a person" [fillcolor="blue"];
"sum" [fillcolor="blue"];
"humanistic study" [fillcolor="blue"];
"organization" [fillcolor="blue"];
"source" [fillcolor="blue"];
"origin" [fillcolor="blue"];
"mathematical statement" [fillcolor="lime"];
"mathematical relation" [fillcolor="lime"];
"field of research" [fillcolor="lime"];
"ragged array" [fillcolor="maroon"];
"list of numeric vector" [fillcolor="blue"];
"refinement of minimax search" [fillcolor="blue"];
"nonbiological intelligence" [fillcolor="maroon"];
"galway conference" [fillcolor="blue"];
"concept" [fillcolor="blue"];
"translation lookaside buffer" [fillcolor="blue"];
"optimization of best-first search" [fillcolor="blue"];
"iterative search" [fillcolor="maroon"];
"core data mining task" [fillcolor="blue"];
"heap-ordered complete binary tree" [fillcolor="maroon"];
"dichotomic divide" [fillcolor="blue"];
"boolean formula" [fillcolor="green"];
"combination of boolean variable" [fillcolor="blue"];
"conditional tautology" [fillcolor="blue"];
"system for logical operation" [fillcolor="maroon"];
"algebraic structure" [fillcolor="maroon"];
"bucket sort" [fillcolor="green"];
"generalization of pigeonhole sort" [fillcolor="blue"];
"classification problem" [fillcolor="green"];
"function approximation" [fillcolor="blue"];
"type of function approximation" [fillcolor="blue"];
"coalitional game" [fillcolor="purple"];
"real-valued set function" [fillcolor="maroon"];
"mix of theory" [fillcolor="blue"];
"art of computational theory" [fillcolor="blue"];
"model for sequence" [fillcolor="blue"];
"owl consistency checker" [fillcolor="maroon"];
"feature" [fillcolor="blue"];
"inference mechanism" [fillcolor="maroon"];
"mean" [fillcolor="blue"];
"smallest convex region" [fillcolor="blue"];
"component of secure information" [fillcolor="blue"];
"space-efficient two-dimensional bar code symbology"
[fillcolor="blue"];
"database analysis application" [fillcolor="blue"];
"parameterized problem" [fillcolor="blue"];
"rooted tree" [fillcolor="maroon"];
"decision support tool" [fillcolor="blue"];
"case of best-first search" [fillcolor="blue"];
"graph traversal" [fillcolor="blue"];
"presentinga derivation" [fillcolor="maroon"];
"expressive decidable logic" [fillcolor="maroon"];
"diagonal matrix" [fillcolor="purple"];
"matrix" [fillcolor="purple"];
"mapping of high-dimensional space" [fillcolor="blue"];
"knowledge learner" [fillcolor="blue"];
"error rate" [fillcolor="green"];
"incoming bit error rate" [fillcolor="blue"];
"euclidean distance" [fillcolor="green"];
"case of minkowski distance" [fillcolor="blue"];
"shortest length" [fillcolor="blue"];
"three-dimensional space of euclidean geometry"
[fillcolor="maroon"];
"example of non-verbal memory" [fillcolor="blue"];
"module" [fillcolor="blue"];
"meas-urements of medical image" [fillcolor="blue"];
"acoustic feature space" [fillcolor="maroon"];
"feature vector" [fillcolor="purple"];
"n-dimensional vector" [fillcolor="maroon"];
"n-dimensional vector of numerical feature" [fillcolor="maroon"];
"imaginary machine" [fillcolor="blue"];
"arc" [fillcolor="blue"];
"refinable parameter" [fillcolor="blue"];
"branch of operations research" [fillcolor="blue"];
"analysis of interaction" [fillcolor="maroon"];
"gaussian kernel" [fillcolor="green"];
"kernel" [fillcolor="blue"];
"nonparametric model for regression" [fillcolor="blue"];
"expression datum" [fillcolor="blue"];
"network of a diseased cell" [fillcolor="maroon"];
"case of graph" [fillcolor="blue"];
"structured data mining" [fillcolor="maroon"];
"case of structured data mining" [fillcolor="blue"];
"harmonic series" [fillcolor="purple"];
"divergent infinite series" [fillcolor="maroon"];
"fraction-like series" [fillcolor="maroon"];
"one-way function" [fillcolor="maroon"];
"table" [fillcolor="blue"];
"array of pointer" [fillcolor="maroon"];
"optimal way" [fillcolor="blue"];
"combination of a continuous system model" [fillcolor="blue"];
"web topic" [fillcolor="blue"];
"research area" [fillcolor="blue"];
"incidence list" [fillcolor="green"];
"variant of the adjacency list" [fillcolor="blue"];
"incidence matrix" [fillcolor="purple"];
"polynomial equation of the first degree" [fillcolor="maroon"];
"algebraic equation" [fillcolor="maroon"];
"television service" [fillcolor="maroon"];
"optimization of linear function" [fillcolor="blue"];
"specialized internet search engine" [fillcolor="maroon"];
"finite set of atom" [fillcolor="blue"];
"finite set" [fillcolor="blue"];
"lower-bounded function" [fillcolor="maroon"];
"computer" [fillcolor="blue"];
"statistic" [fillcolor="blue"];
"subfield of artificial intelligence" [fillcolor="blue"];
"binary operator" [fillcolor="maroon"];
"ubiquitous reasoning pattern" [fillcolor="maroon"];
"nash equilibrium" [fillcolor="green"];
"solution concept of a game" [fillcolor="blue"];
"situation" [fillcolor="blue"];
"machine processing" [fillcolor="maroon"];
"trademark of the search engine google" [fillcolor="blue"];
"methods google" [fillcolor="blue"];
"numeric value" [fillcolor="maroon"];
"web discovery" [fillcolor="blue"];
"analytical rule" [fillcolor="maroon"];
"polynomial space" [fillcolor="green"];
"booean queries expressible" [fillcolor="blue"];
"list of the event" [fillcolor="blue"];
"example of in-place sort" [fillcolor="blue"];
"generalization of a stochastic process" [fillcolor="blue"];
"ensemble of graph" [fillcolor="blue"];
"path" [fillcolor="red"];
"string" [fillcolor="blue"];
"algebraic formula" [fillcolor="maroon"];
"text string" [fillcolor="red"];
"class" [fillcolor="blue"];
"machine" [fillcolor="blue"];
"authentication" [fillcolor="blue"];
"search problem" [fillcolor="purple"];
"search graph" [fillcolor="silver"];
"optimal search problem" [fillcolor="maroon"];
"software solutions company" [fillcolor="blue"];
"long-running world wide web consortium initiative"
[fillcolor="blue"];
"sift feature" [fillcolor="green"];
"image region" [fillcolor="blue"];
"singular value" [fillcolor="purple"];
"largest singular value" [fillcolor="maroon"];
"hand-drawn diagram" [fillcolor="maroon"];
"automated recognition" [fillcolor="maroon"];
"spatial network" [fillcolor="purple"];
"network of spatial element" [fillcolor="maroon"];
"weighted sum" [fillcolor="red"];
"measurement of random error" [fillcolor="blue"];
"analysis tool" [fillcolor="blue"];
"training set" [fillcolor="green"];
"datum" [fillcolor="blue"];
"tree decomposition" [fillcolor="green"];
"mapping of a graph" [fillcolor="blue"];
"version of binary search" [fillcolor="blue"];
"depth-first tree search" [fillcolor="maroon"];
"multiset of undirected edge" [fillcolor="blue"];
"tree iff" [fillcolor="blue"];
"application of datum" [fillcolor="blue"];
"area of data mining" [fillcolor="blue"];
"problem of natural language processing" [fillcolor="blue"];
"worst case analysis" [fillcolor="green"];
"nonstatistical tolerance analysis tool" [fillcolor="blue"];
"event b happening" [fillcolor="blue"];
"part of many constraint programming system" [fillcolor="blue"];
"paradigm" [fillcolor="red"];
"part of most management decisions today" [fillcolor="blue"];
"word for data selection" [fillcolor="maroon"];
"generation" [fillcolor="blue"];
"contiguous section of memory" [fillcolor="blue"];
"base table" [fillcolor="blue"];
"single-agent" [fillcolor="blue"];
"analysis of algorithm" [fillcolor="maroon"];
"list of clause" [fillcolor="blue"];
"machine interpretation of pattern" [fillcolor="blue"];
"polynomial time" [fillcolor="green"];
"boolean queries expressible" [fillcolor="blue"];
"table/ graph" [fillcolor="maroon"];
"software interface" [fillcolor="maroon"];
"foundation" [fillcolor="blue"];
"start" [fillcolor="blue"];
"method toestimate" [fillcolor="blue"];
"kernel function" [fillcolor="purple"];
"gaussian kernel function" [fillcolor="maroon"];
"statistician" [fillcolor="blue"];
"web site" [fillcolor="blue"];
"generalization of the distance metric" [fillcolor="blue"];
"probabilistic model for density estimation" [fillcolor="blue"];
"computational problem" [fillcolor="blue"];
"web-based service" [fillcolor="maroon"];
"software component" [fillcolor="blue"];
"data search capability" [fillcolor="blue"];
"heuristic" [fillcolor="purple"];
"commonsense rule" [fillcolor="maroon"];
"rectangular array of quantity" [fillcolor="maroon"];
"state" [fillcolor="blue"];
"state of a system" [fillcolor="blue"];
"binary space partition" [fillcolor="purple"];
"binary space" [fillcolor="maroon"];
"data variable" [fillcolor="red"];
"dijkstra" [fillcolor="blue"];
"kruskal" [fillcolor="blue"];
"longest common subsequence" [fillcolor="green"];
"subsequence problem" [fillcolor="blue"];
"longest common substring" [fillcolor="green"];
"substring problem" [fillcolor="blue"];
"undirected network" [fillcolor="maroon"];
"sat solver" [fillcolor="green"];
"solver" [fillcolor="blue"];
"time series datum" [fillcolor="green"];
"training datum" [fillcolor="green"];
"generic term" [fillcolor="blue"];
"way human beings process speech" [fillcolor="blue"];
"intelligence program" [fillcolor="maroon"];
"processing element" [fillcolor="blue"];
"binary decomposable" [fillcolor="blue"];
"iff" [fillcolor="blue"];
"domain consistent iff" [fillcolor="blue"];
"finite list of rule" [fillcolor="blue"];
"formulation of semidefinite program" [fillcolor="blue"];
"goal state" [fillcolor="blue"];
"programmable machine" [fillcolor="blue"];
"default neural network" [fillcolor="maroon"];
"canadian variety television series" [fillcolor="maroon"];
"network of pedestrian tunnel" [fillcolor="maroon"];
"entity" [fillcolor="blue"];
"science fiction" [fillcolor="blue"];
"comic book series" [fillcolor="maroon"];
"world wide web page" [fillcolor="blue"];
"computer network" [fillcolor="red"];
"software unit of deployment" [fillcolor="blue"];
"configuration of information" [fillcolor="blue"];
"properties attributable" [fillcolor="blue"];
"project" [fillcolor="blue"];
"course of academic study" [fillcolor="blue"];
"computer circuit" [fillcolor="blue"];
"concept of quantity" [fillcolor="blue"];
"transfer of property" [fillcolor="blue"];
"perceptual structure" [fillcolor="maroon"];
"mixture of ingredient" [fillcolor="blue"];
"arrangement of value" [fillcolor="blue"];
"spatial" [fillcolor="blue"];
"body of rule" [fillcolor="blue"];
"conventionalized statement" [fillcolor="maroon"];
"intricate network" [fillcolor="maroon"];
"people" [fillcolor="blue"];
"series of act" [fillcolor="maroon"];
"item of factual information" [fillcolor="blue"];
"geometric element" [fillcolor="blue"];
"time" [fillcolor="blue"];
"sketch" [fillcolor="blue"];
"lowest support" [fillcolor="blue"];
"lowest support of a structure" [fillcolor="blue"];
"network of neuron" [fillcolor="maroon"];
"two-dimensional euclidean space" [fillcolor="maroon"];
"search research" [fillcolor="blue"];
"pratt" [fillcolor="blue"];
"array of character" [fillcolor="maroon"];
"character string" [fillcolor="blue"];
"weight function" [fillcolor="red"];
"search result" [fillcolor="blue"];
"computer data processing" [fillcolor="maroon"];
"electronic processing" [fillcolor="maroon"];
"organization of datum" [fillcolor="maroon"];
"data preparation" [fillcolor="blue"];
"modal" [fillcolor="blue"];
"state of affair" [fillcolor="blue"];
"discrete data item" [fillcolor="maroon"];
"unit of datum" [fillcolor="blue"];
"gaussian weight function" [fillcolor="maroon"];
"triangle weight function" [fillcolor="maroon"];
"class element" [fillcolor="blue"];
"skillful performance" [fillcolor="blue"];
"network of computer" [fillcolor="maroon"];
"connected series of event" [fillcolor="maroon"];
"reading of a point" [fillcolor="blue"];
"element" [fillcolor="blue"];
"state of change" [fillcolor="blue"];
"organized structure" [fillcolor="maroon"];
"intersection" [fillcolor="blue"];
"graph algorithm" [fillcolor="silver"];
"iterative dynamic programming" [fillcolor="silver"];
"depth first search tree" [fillcolor="silver"];
"prim's algorithm" [fillcolor="silver"];
"drill scheduling" [fillcolor="green"];
"fermat's last theorem" [fillcolor="green"];
"non-metric distance" [fillcolor="silver"];
"planning problem" [fillcolor="green"];
"jordan curve theorem" [fillcolor="green"];
"situation calculus" [fillcolor="green"];
"non-empty set" [fillcolor="green"];
"bellman equation" [fillcolor="silver"];
"merge sort" [fillcolor="green"];
"horn logic" [fillcolor="silver"];
"representation language" [fillcolor="silver"];
"space-efficient dynamic programming" [fillcolor="silver"];
"nondeterministic polynomial time" [fillcolor="green"];
"optimization problem" [fillcolor="green"];
"spectral kernel" [fillcolor="green"];
"probabilistic transition" [fillcolor="green"];
"scheduling problem" [fillcolor="green"];
"argumentation tree" [fillcolor="silver"];
"undecidable problem" [fillcolor="green"];
"hider-seeker game" [fillcolor="green"];
"matrix factorization" [fillcolor="green"];
"breadth first search tree" [fillcolor="silver"];
"constraint optimization" [fillcolor="green"];
"stochastic game" [fillcolor="green"];
"average case analysis" [fillcolor="silver"];
"covariance function" [fillcolor="silver"];
"planning algorithm" [fillcolor="silver"];
"graph representation" [fillcolor="silver"];
"robot motion planning" [fillcolor="green"];
"neighborhood kernel" [fillcolor="green"];
"selection sorting" [fillcolor="green"];
"sparse covariance" [fillcolor="green"];
"christofides' heuristic" [fillcolor="silver"];
"mobile sensor" [fillcolor="green"];
"parallel sat" [fillcolor="green"];
"fcrfs model" [fillcolor="silver"];
"semi-supervised feature selection" [fillcolor="silver"];
"visual feature" [fillcolor="green"];
"airflow simulation" [fillcolor="green"];
"component graph" [fillcolor="silver"];
"sparse covariance function" [fillcolor="silver"];
"regret minimization" [fillcolor="green"];
"constraint satisfaction problem" [fillcolor="green"];
"randomized algorithm" [fillcolor="silver"];
"spanning tree" [fillcolor="silver"];
"semi-supervised classification" [fillcolor="green"];
"comparison sorting" [fillcolor="green"];
"traveling salesman problem" [fillcolor="green"];
"constraint calculus" [fillcolor="green"];
"affinity graph" [fillcolor="silver"];
"heap selection" [fillcolor="silver"];
"closed form" [fillcolor="green"];
"expected case analysis" [fillcolor="silver"];
"functional e-majsat" [fillcolor="green"];
"patrol algorithm" [fillcolor="silver"];
"nested monte-carlo search" [fillcolor="silver"];
"search node" [fillcolor="silver"];
"hidden variable" [fillcolor="silver"];
"distance metric learning" [fillcolor="green"];
"qualitative calculus" [fillcolor="green"];
"golog program" [fillcolor="silver"];
"minimum pursuer problem" [fillcolor="green"];
"recursive dynamic programming" [fillcolor="silver"];
"cnf decomposition" [fillcolor="green"];
"unequal divide and conquer" [fillcolor="green"];
"bsp tree" [fillcolor="silver"];
"bounded halting" [fillcolor="green"];
"parameterized random variable" [fillcolor="silver"];
"acyclic graph" [fillcolor="silver"];
"binary relation" [fillcolor="silver"];
"covariance matrix" [fillcolor="silver"];
"classification function" [fillcolor="silver"];
"search space" [fillcolor="silver"];
"principal component" [fillcolor="green"];
"o-notation" [fillcolor="green"];
"incremental search" [fillcolor="silver"];
"stability of sorting algorithm" [fillcolor="green"];
"propagation algorithm" [fillcolor="silver"];
"cluster assignment matrix" [fillcolor="silver"];
"branch-and-bound search" [fillcolor="silver"];
"cook's theorem" [fillcolor="green"];
"epistemic structure" [fillcolor="silver"];
"bound search" [fillcolor="silver"];
"horn e-contraction" [fillcolor="green"];
"distance function" [fillcolor="silver"];
"boruvka's algorithm" [fillcolor="silver"];
"incremental algorithm" [fillcolor="silver"];
"divide and conquer algorithm" [fillcolor="silver"];
"union-find problem" [fillcolor="green"];
"inference method" [fillcolor="silver"];
"monte-carlo search" [fillcolor="silver"];
"heapification" [fillcolor="green"];
"feature subscription" [fillcolor="green"];
"event calculus" [fillcolor="green"];
"constrained mutual subspace" [fillcolor="green"];
"strong connectivity algorithm" [fillcolor="silver"];
"latent perceptron" [fillcolor="green"];
"weighted heuristics mechanism" [fillcolor="silver"];
"entity tree" [fillcolor="silver"];
"soft global constraint" [fillcolor="silver"];
"iterative algorithm" [fillcolor="silver"];
"rating matrix" [fillcolor="silver"];
"pareto set" [fillcolor="green"];
"query mining" [fillcolor="green"];
"hybrid mst algorithm" [fillcolor="silver"];
"unsatisfied clause" [fillcolor="silver"];
"model parameter" [fillcolor="green"];
"bayesian game" [fillcolor="green"];
"regularization parameter" [fillcolor="green"];
"cq entailment" [fillcolor="green"];
"bottom-up dynamic programming" [fillcolor="silver"];
"reward function" [fillcolor="silver"];
"consistency problem" [fillcolor="green"];
"knuth-morris-pratt algorithm" [fillcolor="silver"];
"unlabeled datum" [fillcolor="green"];
"probabilistic planning" [fillcolor="green"];
"naive method" [fillcolor="silver"];
"evaluation function" [fillcolor="silver"];
"cluster ensemble" [fillcolor="green"];
"dependency graph" [fillcolor="silver"];
"kernel matrix" [fillcolor="silver"];
"utility space" [fillcolor="silver"];
"heap property" [fillcolor="silver"];
"uniformly weighted heuristic" [fillcolor="silver"];
"single-source shortest path problem" [fillcolor="green"];
"unary notation" [fillcolor="green"];
"multiset variable" [fillcolor="silver"];
"partial regression" [fillcolor="green"];
"htn model" [fillcolor="silver"];
"compilation complexity" [fillcolor="silver"];
"consistency algorithm" [fillcolor="silver"];
"feature selection method" [fillcolor="silver"];
"local consistency" [fillcolor="green"];
"nondeterministic planning" [fillcolor="green"];
"basic action theory" [fillcolor="silver"];
"dcop algorithm" [fillcolor="silver"];
"component analysis" [fillcolor="silver"];
"top-down dynamic programming" [fillcolor="silver"];
"object oriented representation (of graphs)" [fillcolor="green"];
"map variable" [fillcolor="silver"];
"expression pattern" [fillcolor="silver"];
"neural information processing" [fillcolor="silver"];
"deterministic selection" [fillcolor="silver"];
"aggregation parfactor" [fillcolor="green"];
"markov decision" [fillcolor="green"];
"fibonacci heap" [fillcolor="silver"];
"kernel learning" [fillcolor="green"];
"horn shiq" [fillcolor="green"];
"point-based algorithm" [fillcolor="silver"];
"omega-notation" [fillcolor="green"];
"turning radius" [fillcolor="green"];
"cdcl solver" [fillcolor="green"];
"linear order" [fillcolor="green"];
"benchmark data set" [fillcolor="silver"];
"data,information" [fillcolor="lime"];
"package,software,software system" [fillcolor="lime"];
"procedure,process" [fillcolor="lime"];
"knowledge domain,knowledge base,domain" [fillcolor="lime"];
"act,action,activity" [fillcolor="lime"];
"quantity,measure" [fillcolor="lime"];
"discipline,study,field of study" [fillcolor="lime"];
"technique,technology,approach" [fillcolor="lime"];
"methodology,method" [fillcolor="lime"];
"data structure" -> "adjacency list"[label="0.8281573498964804"];
"knowledge" -> "representation"[label="0.6086956521739131"];
"representation of a graph" -> "adjacency
matrix"[label="0.7060041407867494"];
"representation" -> "representation of a
graph"[label="0.7039337474120083"];
"computer science" -> "artificial
intelligence"[label="0.9917184265010351"];
"abstraction" -> "system"[label="0.38509316770186336"];
"algorithm" -> "computer science"[label="0.979296066252588"];
"property of the soar" -> "associative
memory"[label="0.5175983436853002"];
"property" -> "property of the soar"[label="0.515527950310559"];
"abstraction" -> "property"[label="0.38509316770186336"];
"graph" -> "bayesian network"[label="0.8530020703933747"];
"representation" -> "model"[label="0.7039337474120083"];
"data structure" -> "graph"[label="0.8281573498964804"];
"heuristic search algorithm" -> "beam
search"[label="0.9813664596273292"];
"algorithm" -> "heuristic search
algorithm"[label="0.979296066252588"];
"probability inference algorithm" -> "belief
propagation"[label="0.9813664596273292"];
"algorithm" -> "probability inference
algorithm"[label="0.979296066252588"];
"search algorithm" -> "best-first
search"[label="0.9875776397515528"];
"algorithm" -> "search algorithm"[label="0.979296066252588"];
"constraint" -> "binary constraint"[label="0.9316770186335404"];
"rule" -> "constraint"[label="0.927536231884058"];
"heap" -> "binary heap"[label="0.8322981366459627"];
"specialized tree-based data structure" ->
"heap"[label="0.8302277432712215"];
"conquer search algorithm" -> "binary
search"[label="0.9813664596273292"];
"algorithm" -> "conquer search
algorithm"[label="0.979296066252588"];
"function" -> "boolean function"[label="0.8178053830227743"];
"communication" -> "expression"[label="0.4658385093167702"];
"logic" -> "boolean logic"[label="0.9213250517598344"];
"communication" -> "language"[label="0.4658385093167702"];
"variable" -> "boolean variable"[label="0.7743271221532091"];
"facility" -> "variable"[label="0.7660455486542443"];
"algorithm" -> "breadth first search"[label="0.979296066252588"];
"ability" -> "classification accuracy"[label="0.6252587991718427"];
"quality" -> "ability"[label="0.5900621118012422"];
"auction" -> "combinatorial auction"[label="0.8633540372670807"];
"processing" -> "computational
complexity"[label="0.8260869565217391"];
"computation" -> "computational complexity
theory"[label="0.917184265010352"];
"abstraction" -> "knowledge"[label="0.38509316770186336"];
"extraction" -> "computer vision"[label="0.7950310559006211"];
"probability" -> "conditional
probability"[label="0.6149068322981367"];
"knowledge" -> "probability"[label="0.6086956521739131"];
"logistic regression" -> "conditional random
field"[label="0.8364389233954451"];
"multivariate analysis method of marketing information" ->
"logistic regression"[label="0.8302277432712215"];
"program" -> "consistency checker"[label="0.782608695652174"];
"service" -> "program"[label="0.7577639751552795"];
"constraint" -> "constraint network"[label="0.9316770186335404"];
"point" -> "node"[label="0.5548654244306418"];
"iterative process" -> "constraint
propagation"[label="0.865424430641822"];
"ability" -> "intelligence"[label="0.6252587991718427"];
"polygon" -> "convex hull"[label="0.7080745341614907"];
"representation" -> "polygon"[label="0.7039337474120083"];
"polygon" -> "convex polygon"[label="0.7080745341614907"];
"measure of similarity" -> "cosine
similarity"[label="0.4057971014492754"];
"model evaluation method" -> "cross
validation"[label="0.8260869565217391"];
"numerical algorithm" ->
"cryptography"[label="0.9813664596273292"];
"communication" -> "code"[label="0.4658385093167702"];
"algorithm" -> "numerical algorithm"[label="0.979296066252588"];
"code" -> "data matrix"[label="0.494824016563147"];
"algorithm" -> "data mining"[label="0.979296066252588"];
"question" -> "decision problem"[label="0.6252587991718427"];
"graphical model" -> "decision tree"[label="0.8571428571428571"];
"data structure" -> "tree"[label="0.8281573498964804"];
"tree" -> "decomposition tree"[label="0.8405797101449275"];
"best-first search" -> "depth-first
search"[label="0.9937888198757764"];
"planar representation" -> "derivation
tree"[label="0.7060041407867494"];
"representation" -> "planar
representation"[label="0.7039337474120083"];
"formalism for knowledge representation" -> "description
logic"[label="0.7060041407867494"];
"representation" -> "formalism for knowledge
representation"[label="0.7039337474120083"];
"model of a machine" -> "deterministic finite
automaton"[label="0.7639751552795031"];
"model" -> "model of a machine"[label="0.7619047619047619"];
"vector field" -> "differential
equation"[label="0.8198757763975155"];
"statement" -> "equation"[label="0.7039337474120083"];
"function" -> "vector field"[label="0.8178053830227743"];
"probability model" -> "discriminative
model"[label="0.7639751552795031"];
"model" -> "probability model"[label="0.7619047619047619"];
"rule" -> "domain knowledge"[label="0.927536231884058"];
"algorithm" -> "dynamic programming"[label="0.979296066252588"];
"function" -> "eigenvalue"[label="0.8178053830227743"];
"forgetful em algorithm" -> "em
algorithm"[label="0.9813664596273292"];
"algorithm" -> "forgetful em algorithm"[label="0.979296066252588"];
"equality" -> "equivalence class"[label="0.5921325051759835"];
"quality" -> "equality"[label="0.5900621118012422"];
"relation" -> "equivalence relation"[label="0.41821946169772256"];
"abstraction" -> "relation"[label="0.38509316770186336"];
"euclidean plane" -> "euclidean space"[label="0.6853002070393375"];
"euclidean geometry" -> "euclidean
plane"[label="0.6832298136645962"];
"desktop access control software" -> "face
recognition"[label="0.5093167701863354"];
"selection" -> "feature selection"[label="0.8633540372670807"];
"space" -> "feature space"[label="0.6169772256728778"];
"number" -> "fibonacci number"[label="0.8053830227743272"];
"series" -> "number"[label="0.7971014492753623"];
"model of a synchronous order machine" -> "finite state
machine"[label="0.7660455486542443"];
"model" -> "model of a synchronous order
machine"[label="0.7619047619047619"];
"system" -> "first-order logic"[label="0.4244306418219462"];
"function" -> "flow network"[label="0.8178053830227743"];
"function" -> "free variable"[label="0.8178053830227743"];
"representation" -> "game tree"[label="0.7039337474120083"];
"stochastic process" -> "gaussian
process"[label="0.865424430641822"];
"model" -> "generative model"[label="0.7619047619047619"];
"network" -> "gene expression pattern"[label="0.8737060041407867"];
"digraph" -> "network"[label="0.8695652173913043"];
"first-order optimization algorithm" -> "gradient
descent"[label="0.9813664596273292"];
"algorithm" -> "first-order optimization
algorithm"[label="0.979296066252588"];
"register allocation algorithm" -> "graph
coloring"[label="0.9813664596273292"];
"algorithm" -> "register allocation
algorithm"[label="0.979296066252588"];
"data mining" -> "graph mining"[label="0.9834368530020704"];
"model" -> "pattern"[label="0.7619047619047619"];
"graph" -> "graphical model"[label="0.8530020703933747"];
"approximate algorithm" -> "greedy
algorithm"[label="0.9813664596273292"];
"algorithm" -> "approximate algorithm"[label="0.979296066252588"];
"algorithm" -> "hash function"[label="0.979296066252588"];
"data structure" -> "hash table"[label="0.8281573498964804"];
"sorting information" -> "heap sort"[label="0.42028985507246375"];
"search technique" -> "heuristic
search"[label="0.8219461697722568"];
"clause" -> "horn clause"[label="0.494824016563147"];
"expression" -> "clause"[label="0.4927536231884058"];
"planning methodology" -> "htn
planning"[label="0.782608695652174"];
"expression" -> "hybrid model"[label="0.4927536231884058"];
"iterative process" -> "image
retrieval"[label="0.865424430641822"];
"rule" -> "inference rule"[label="0.927536231884058"];
"information retrieval" -> "information
extraction"[label="0.865424430641822"];
"oriented graph" -> "interaction
graph"[label="0.8716356107660456"];
"digraph" -> "oriented graph"[label="0.8695652173913043"];
"asymmetric divergence measure" -> "kl
divergence"[label="0.4057971014492754"];
"equation" -> "linear equation"[label="0.7080745341614907"];
"computational method" -> "linear
programming"[label="0.8260869565217391"];
"metaheuristic" -> "local search"[label="0.8281573498964804"];
"heuristic method" -> "metaheuristic"[label="0.8260869565217391"];
"rule" -> "logic program"[label="0.927536231884058"];
"computer program" -> "logic
programming"[label="0.9937888198757764"];
"algorithm" -> "computer program"[label="0.979296066252588"];
"computer program" -> "machine
learning"[label="0.9937888198757764"];
"translation" -> "machine translation"[label="0.8633540372670807"];
"finite state machine" -> "markov
model"[label="0.7701863354037267"];
"undirected graph" -> "markov network"[label="0.8571428571428571"];
"graph" -> "undirected graph"[label="0.8530020703933747"];
"probabilistic model" -> "mixture
model"[label="0.8053830227743272"];
"law" -> "modal logic"[label="0.9316770186335404"];
"operation" -> "logic"[label="0.9130434782608695"];
"operator" -> "modal operator"[label="0.8240165631469979"];
"rule" -> "law"[label="0.927536231884058"];
"function" -> "operator"[label="0.8178053830227743"];
"automated verification method" -> "model
checking"[label="0.8260869565217391"];
"computer science" -> "natural language
processing"[label="0.9917184265010351"];
"geometry" -> "non-euclidean geometry"[label="0.6811594202898551"];
"line" -> "geometry"[label="0.6770186335403726"];
"probability distribution" -> "normal
distribution"[label="0.7060041407867494"];
"distribution" -> "probability
distribution"[label="0.6997929606625258"];
"theory" -> "np-completeness"[label="0.7846790890269151"];
"system" -> "optimal solution"[label="0.4244306418219462"];
"link analysis algorithm" ->
"pagerank"[label="0.9813664596273292"];
"algorithm" -> "link analysis
algorithm"[label="0.979296066252588"];
"cpu intensive process" -> "pattern
matching"[label="0.8633540372670807"];
"machine learning" -> "pattern recognition"[label="1.0"];
"algorithm" -> "polynomial-time
algorithm"[label="0.979296066252588"];
"probability" -> "posterior
probability"[label="0.6149068322981367"];
"abstraction" -> "event"[label="0.38509316770186336"];
"logic" -> "propositional logic"[label="0.9213250517598344"];
"software program" -> "qbf solver"[label="0.906832298136646"];
"coolest algorithm" -> "quick sort"[label="0.9813664596273292"];
"algorithm" -> "coolest algorithm"[label="0.979296066252588"];
"conditional random field" -> "random
field"[label="0.8405797101449275"];
"graph" -> "random graph"[label="0.8530020703933747"];
"function" -> "random variable"[label="0.8178053830227743"];
"stochastic process" -> "random walk"[label="0.865424430641822"];
"software tool" -> "recommender
system"[label="0.9958592132505176"];
"computer program" -> "software tool"[label="0.9937888198757764"];
"formula" -> "regular expression"[label="0.906832298136646"];
"machine learning" -> "reinforcement learning"[label="1.0"];
"public-key encryption algorithm" -> "rsa
encryption"[label="0.9813664596273292"];
"algorithm" -> "public-key encryption
algorithm"[label="0.979296066252588"];
"decision problem" -> "satisfiability
problem"[label="0.6335403726708074"];
"tree data structure" -> "search tree"[label="0.8302277432712215"];
"data structure" -> "tree data
structure"[label="0.8281573498964804"];
"indefinite domain of possible expression" -> "semantic
space"[label="0.6190476190476191"];
"search technique" -> "sequential
search"[label="0.8219461697722568"];
"recognition" -> "sketch recognition"[label="0.6273291925465838"];
"ability" -> "recognition"[label="0.6252587991718427"];
"structure" -> "social network"[label="0.8281573498964804"];
"composition" -> "structure"[label="0.8240165631469979"];
"intelligence" -> "spatial reasoning"[label="0.6418219461697723"];
"probability" -> "standard deviation"[label="0.6149068322981367"];
"diagram" -> "state diagram"[label="0.5113871635610766"];
"algorithm" -> "string matching"[label="0.979296066252588"];
"vector" -> "support vector"[label="0.4492753623188406"];
"modal logic" -> "temporal logic"[label="0.9358178053830227"];
"operation" -> "time complexity"[label="0.9130434782608695"];
"quality" -> "complexity"[label="0.5900621118012422"];
"function" -> "transition function"[label="0.8178053830227743"];
"algorithm" -> "tree search"[label="0.979296066252588"];
"interface" -> "user interface"[label="0.7846790890269151"];
"property" -> "point"[label="0.515527950310559"];
"program" -> "interface"[label="0.782608695652174"];
"formula" -> "utility function"[label="0.906832298136646"];
"communication" -> "web service"[label="0.4658385093167702"];
"abstraction" -> "communication"[label="0.38509316770186336"];
"distance" -> "space"[label="0.5859213250517599"];
"computer program" -> "search engine"[label="0.9937888198757764"];
"hierarchical bayesian model" -> "topic
model"[label="0.7639751552795031"];
"model" -> "hierarchical bayesian
model"[label="0.7619047619047619"];
"neural network" -> "support vector
machine"[label="0.9958592132505176"];
"computer program" -> "neural network"[label="0.9937888198757764"];
"motion" -> "question"[label="0.6169772256728778"];
"decision problem" -> "halting
problem"[label="0.6335403726708074"];
"number" -> "array"[label="0.8053830227743272"];
"function" -> "cost function"[label="0.8178053830227743"];
"value" -> "data set"[label="0.6190476190476191"];
"quality" -> "value"[label="0.5900621118012422"];
"depth-first search" -> "depth first
search"[label="0.9979296066252588"];
"optimal greedy algorithm" -> "dijkstra's
algorithm"[label="0.9813664596273292"];
"algorithm" -> "optimal greedy
algorithm"[label="0.979296066252588"];
"directed graph" -> "directed acyclic
graph"[label="0.8633540372670807"];
"graph" -> "directed graph"[label="0.8530020703933747"];
"directed graph" -> "digraph"[label="0.8633540372670807"];
"algorithm" -> "kruskal's algorithm"[label="0.979296066252588"];
"data item" -> "labeled datum"[label="0.6211180124223602"];
"value" -> "data item"[label="0.6190476190476191"];
"rule" -> "language model"[label="0.927536231884058"];
"variable" -> "latent variable"[label="0.7743271221532091"];
"network" -> "learning algorithm"[label="0.8737060041407867"];
"tree" -> "minimum spanning tree"[label="0.8405797101449275"];
"function" -> "objective function"[label="0.8178053830227743"];
"computer site-selection model" -> "regression
model"[label="0.7639751552795031"];
"model" -> "computer site-selection
model"[label="0.7619047619047619"];
"algorithm" -> "sorting algorithm"[label="0.979296066252588"];
"data structure" -> "specialized tree-based data
structure"[label="0.8281573498964804"];
"service" -> "facility"[label="0.7577639751552795"];
"property" -> "quality"[label="0.515527950310559"];
"act of help" -> "service"[label="0.7246376811594203"];
"program" -> "series"[label="0.782608695652174"];
"geometry" -> "euclidean geometry"[label="0.6811594202898551"];
"point" -> "distance"[label="0.5548654244306418"];
"event" -> "motion"[label="0.6086956521739131"];
"communication" -> "mathematical
statement"[label="0.4658385093167702"];
"relation" -> "mathematical relation"[label="0.41821946169772256"];
"function" -> "real-valued set function"[label="1.0"];
"real-valued set function" -> "coalitional game"[label="0.0"];
"vector" -> "n-dimensional vector"[label="1.0"];
"n-dimensional vector" -> "feature vector"[label="0.0"];
"series" -> "divergent infinite series"[label="1.0"];
"divergent infinite series" -> "harmonic series"[label="0.0"];
"graph" -> "search graph"[label="1.0"];
"search graph" -> "search problem"[label="0.33333333333333337"];
"value" -> "largest singular value"[label="1.0"];
"largest singular value" -> "singular value"[label="0.0"];
"network" -> "network of spatial element"[label="1.0"];
"network of spatial element" -> "spatial network"[label="0.0"];
"function" -> "gaussian kernel function"[label="1.0"];
"gaussian kernel function" -> "kernel function"[label="0.0"];
"rule" -> "commonsense rule"[label="1.0"];
"commonsense rule" -> "heuristic"[label="0.0"];
"array" -> "rectangular array of quantity"[label="1.0"];
"rectangular array of quantity" -> "matrix"[label="0.0"];
"matrix" -> "diagonal matrix"[label="0.0"];
"matrix" -> "incidence matrix"[label="0.0"];
"space" -> "binary space"[label="1.0"];
"binary space" -> "binary space partition"[label="0.0"];
"algorithm" -> "graph algorithm"[label="1.0"];
"dynamic programming" -> "iterative dynamic
programming"[label="1.0"];
"search tree" -> "depth first search tree"[label="1.0"];
"algorithm" -> "prim's algorithm"[label="1.0"];
"distance" -> "non-metric distance"[label="1.0"];
"equation" -> "bellman equation"[label="1.0"];
"logic" -> "horn logic"[label="1.0"];
"language" -> "representation language"[label="1.0"];
"dynamic programming" -> "space-efficient dynamic
programming"[label="1.0"];
"tree" -> "argumentation tree"[label="1.0"];
"search tree" -> "breadth first search tree"[label="1.0"];
"analysis" -> "average case analysis"[label="1.0"];
"function" -> "covariance function"[label="1.0"];
"algorithm" -> "planning algorithm"[label="1.0"];
"representation" -> "graph representation"[label="1.0"];
"heuristic" -> "christofides' heuristic"[label="1.0"];
"model" -> "fcrfs model"[label="1.0"];
"feature selection" -> "semi-supervised feature
selection"[label="1.0"];
"graph" -> "component graph"[label="1.0"];
"covariance function" -> "sparse covariance function"[label="1.0"];
"algorithm" -> "randomized algorithm"[label="1.0"];
"tree" -> "spanning tree"[label="1.0"];
"graph" -> "affinity graph"[label="1.0"];
"selection" -> "heap selection"[label="1.0"];
"analysis" -> "expected case analysis"[label="1.0"];
"algorithm" -> "patrol algorithm"[label="1.0"];
"search" -> "nested monte-carlo search"[label="1.0"];
"node" -> "search node"[label="1.0"];
"variable" -> "hidden variable"[label="1.0"];
"program" -> "golog program"[label="1.0"];
"dynamic programming" -> "recursive dynamic
programming"[label="1.0"];
"tree" -> "bsp tree"[label="1.0"];
"random variable" -> "parameterized random variable"[label="1.0"];
"graph" -> "acyclic graph"[label="1.0"];
"relation" -> "binary relation"[label="1.0"];
"matrix" -> "covariance matrix"[label="1.0"];
"function" -> "classification function"[label="1.0"];
"space" -> "search space"[label="1.0"];
"search" -> "incremental search"[label="1.0"];
"algorithm" -> "propagation algorithm"[label="1.0"];
"matrix" -> "cluster assignment matrix"[label="1.0"];
"search" -> "branch-and-bound search"[label="1.0"];
"structure" -> "epistemic structure"[label="1.0"];
"search" -> "bound search"[label="1.0"];
"function" -> "distance function"[label="1.0"];
"algorithm" -> "boruvka's algorithm"[label="1.0"];
"algorithm" -> "incremental algorithm"[label="1.0"];
"algorithm" -> "divide and conquer algorithm"[label="1.0"];
"search" -> "monte-carlo search"[label="1.0"];
"algorithm" -> "strong connectivity algorithm"[label="1.0"];
"mechanism" -> "weighted heuristics mechanism"[label="1.0"];
"tree" -> "entity tree"[label="1.0"];
"constraint" -> "soft global constraint"[label="1.0"];
"algorithm" -> "iterative algorithm"[label="1.0"];
"matrix" -> "rating matrix"[label="1.0"];
"algorithm" -> "hybrid mst algorithm"[label="1.0"];
"clause" -> "unsatisfied clause"[label="1.0"];
"dynamic programming" -> "bottom-up dynamic
programming"[label="1.0"];
"function" -> "reward function"[label="1.0"];
"algorithm" -> "knuth-morris-pratt algorithm"[label="1.0"];
"function" -> "evaluation function"[label="1.0"];
"graph" -> "dependency graph"[label="1.0"];
"matrix" -> "kernel matrix"[label="1.0"];
"space" -> "utility space"[label="1.0"];
"property" -> "heap property"[label="1.0"];
"heuristic" -> "uniformly weighted heuristic"[label="1.0"];
"variable" -> "multiset variable"[label="1.0"];
"model" -> "htn model"[label="1.0"];
"complexity" -> "compilation complexity"[label="1.0"];
"algorithm" -> "consistency algorithm"[label="1.0"];
"action theory" -> "basic action theory"[label="1.0"];
"algorithm" -> "dcop algorithm"[label="1.0"];
"analysis" -> "component analysis"[label="1.0"];
"dynamic programming" -> "top-down dynamic
programming"[label="1.0"];
"variable" -> "map variable"[label="1.0"];
"pattern" -> "expression pattern"[label="1.0"];
"information processing" -> "neural information
processing"[label="1.0"];
"selection" -> "deterministic selection"[label="1.0"];
"heap" -> "fibonacci heap"[label="1.0"];
"algorithm" -> "point-based algorithm"[label="1.0"];
"data set" -> "benchmark data set"[label="1.0"];
"formula" -> "boolean formula"[label="1.0"];
"distance" -> "euclidean distance"[label="1.0"];
"space" -> "polynomial space"[label="1.0"];
"analysis" -> "worst case analysis"[label="1.0"];
"algorithm" -> "stability of sorting algorithm"[label="1.0"];
"abstraction" -> "data,information"[label="1.0"];
"data,information" -> "sorting information"[label="1.0"];
"data,information" -> "image annotation"[label="1.0"];
"code" -> "package,software,software system"[label="1.0"];
"package,software,software system" -> "diagram"[label="1.0"];
"package,software,software system" -> "desktop access control
software"[label="1.0"];
"procedure,process" -> "feature extraction"[label="1.0"];
"procedure,process" -> "stochastic process"[label="1.0"];
"procedure,process" -> "word sense disambiguation"[label="1.0"];
"procedure,process" -> "phenomenon"[label="1.0"];
"procedure,process" -> "software program"[label="1.0"];
"procedure,process" -> "operation"[label="1.0"];
"procedure,process" -> "algorithm"[label="1.0"];
"procedure,process" -> "mesh generation"[label="1.0"];
"procedure,process" -> "reduction algorithm"[label="1.0"];
"procedure,process" -> "object recognition"[label="1.0"];
"procedure,process" -> "selection"[label="1.0"];
"procedure,process" -> "auction"[label="1.0"];
"procedure,process" -> "dimensionality reduction"[label="1.0"];
"procedure,process" -> "iterative process"[label="1.0"];
"procedure,process" -> "integer factorization"[label="1.0"];
"procedure,process" -> "mechanism"[label="1.0"];
"procedure,process" -> "computation"[label="1.0"];
"procedure,process" -> "information processing"[label="1.0"];
"procedure,process" -> "formula"[label="1.0"];
"procedure,process" -> "constraint satisfaction"[label="1.0"];
"procedure,process" -> "analysis"[label="1.0"];
"procedure,process" -> "cpu intensive process"[label="1.0"];
"procedure,process" -> "translation"[label="1.0"];
"procedure,process" -> "rule"[label="1.0"];
"procedure,process" -> "information retrieval"[label="1.0"];
"procedure,process" -> "matrix multiplication"[label="1.0"];
"procedure,process" -> "web mining"[label="1.0"];
"procedure,process" -> "discriminant analysis"[label="1.0"];
"knowledge" -> "knowledge domain,knowledge
base,domain"[label="1.0"];
"knowledge domain,knowledge base,domain" -> "indefinite domain of
possible expression"[label="1.0"];
"knowledge domain,knowledge base,domain" -> "field of
research"[label="1.0"];
"knowledge domain,knowledge base,domain" -> "data
structure"[label="1.0"];
"knowledge domain,knowledge base,domain" -> "theory"[label="1.0"];
"event" -> "act,action,activity"[label="1.0"];
"act,action,activity" -> "search"[label="1.0"];
"act,action,activity" -> "line"[label="1.0"];
"act,action,activity" -> "service composition"[label="1.0"];
"act,action,activity" -> "act of help"[label="1.0"];
"act,action,activity" -> "statement"[label="1.0"];
"act,action,activity" -> "distribution"[label="1.0"];
"act,action,activity" -> "action theory"[label="1.0"];
"act,action,activity" -> "function"[label="1.0"];
"act,action,activity" -> "procedure,process"[label="1.0"];
"act,action,activity" -> "extraction"[label="1.0"];
"abstraction" -> "quantity,measure"[label="1.0"];
"quantity,measure" -> "loss function"[label="1.0"];
"quantity,measure" -> "measure of similarity"[label="1.0"];
"quantity,measure" -> "asymmetric divergence measure"[label="1.0"];
"quantity,measure" -> "vector"[label="1.0"];
"knowledge domain,knowledge base,domain" -> "discipline,study,field
of study"[label="1.0"];
"discipline,study,field of study" -> "science"[label="1.0"];
"knowledge domain,knowledge base,domain" ->
"technique,technology,approach"[label="1.0"];
"technique,technology,approach" -> "kernel method"[label="1.0"];
"technique,technology,approach" -> "search technique"[label="1.0"];
"technique,technology,approach" -> "semi-supervised
learning"[label="1.0"];
"technique,technology,approach" -> "probabilistic
model"[label="1.0"];
"technique,technology,approach" -> "game theory"[label="1.0"];
"technique,technology,approach" -> "binary
classification"[label="1.0"];
"technique,technology,approach" -> "composition"[label="1.0"];
"knowledge domain,knowledge base,domain" ->
"methodology,method"[label="1.0"];
"methodology,method" -> "maximum likelihood"[label="1.0"];
"methodology,method" -> "approximation algorithm"[label="1.0"];
"methodology,method" -> "semantic web"[label="1.0"];
"methodology,method" -> "finite element method"[label="1.0"];
"methodology,method" -> "model evaluation method"[label="1.0"];
"methodology,method" -> "computational method"[label="1.0"];
"methodology,method" -> "inference method"[label="1.0"];
"methodology,method" -> "planning methodology"[label="1.0"];
"methodology,method" -> "feature selection method"[label="1.0"];
"methodology,method" -> "processing"[label="1.0"];
"methodology,method" -> "boyer-moore algorithm"[label="1.0"];
"methodology,method" -> "automated verification
method"[label="1.0"];
"methodology,method" -> "naive method"[label="1.0"];
"methodology,method" -> "heuristic method"[label="1.0"];
"methodology,method" -> "alpha-beta search"[label="1.0"];
"methodology,method" -> "multivariate analysis method of marketing
information"[label="1.0"];
"methodology,method" -> "search method"[label="1.0"];
}