6 ms·

("Mind maps are similar in structure to concept maps, developed by learning experts in the 1970s, but differ in that mind maps are simplified by focusing around

by jonsen 5y ago

("Mind maps are similar in structure to concept maps, developed by learning experts in the 1970s, but differ in that mind maps are simplified by focusing around a single central key concept."): https://en.m.wikipedia.org/wiki/Mind_map https://en.m.wikipedia.org/wiki/Mind_map

productceo 5y ago
Perfect one sentence summary. I wasted a minute or two searching online for the difference between the two, but I should have read your comment first! Thanks for communicating precisely and concisely.
- westurner 5y ago
  While scoping is necessary and useful, I hadn't ever learned that there were categorical restrictions upon mind map graphs, definitionally Centrality, Components, Cliques might be helpful for general network analysis: https://networkx.org/documentation/stable/reference/algorithms/centrality.html https://networkx.org/documentation/stable/reference/algorith... The difference between a URI and a URL; a URL is supposed to be dereferenceable and retrievable. Named Graphs are composed of triples: {named_graph_uri, subject_uri, predicate_uri, value_uri, [datatype_uri, language_uri]} {g, s, p, o, [d, l]} E.g. Rdflib supports various stores for and representations of RDF: https://en.wikipedia.org/wiki/RDFLib https://en.wikipedia.org/wiki/RDFLib Though, general systems are more complex than the average [concept] network: there are nonlinearities in so many of the observed relations between components that trees and DAGs are laughably insufficient; systems descriptions require more than naievely-acyclical graphs without nonlinearity in independent relations even. Graph (disambiguation) https://en.wikipedia.org/wiki/Graph https://en.wikipedia.org/wiki/Graph Glossary of systems theory https://en.wikipedia.org/wiki/Glossary_of_systems_theory https://en.wikipedia.org/wiki/Glossary_of_systems_theory How best to describe nonlinear relations without a MultiDiGraph that bundles edges together by [QFT] field, because they're objectively not statistically independent?
  - westurner 5y ago
    s/value_uri/object/, which may be a URI: {named_graph_uri, subject_uri, predicate_uri, object, [datatype_uri, language_uri]} {g, s, p, o, [d], [l]} A mindmap, where e.g. g=example.org/mind-maps/2022#our-mind-map and "a" is "xsd:type": @base <_#> . @prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> . @prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> . @prefix schema: <https://schema.org/> . :Node, a, rdfs:Class . :linksTo, a, rdfs:Property . :Shapes, a, :Node . :Shapes, :linksTo, :Rectangle . :Rectangle, a, :Node . :Rectangle, :linksTo, :Square . :Square, a, :Node . :Square, rdfs:label, "Square" . :Square, schema:name, "Square" . :Rectangle, rdfs:subClassOf, :Shape . :Square, rdfs:subClassOf, :Rectangle . https://en.wikipedia.org/wiki/Notation3#Comparison_of_Notation3,_Turtle,_and_N-Triples https://en.wikipedia.org/wiki/Notation3#Comparison_of_Notati... https://www.w3.org/TR/turtle/#sec-intro https://www.w3.org/TR/turtle/#sec-intro

by jonsen 5y ago

productceo 5y ago

Perfect one sentence summary. I wasted a minute or two searching online for the difference between the two, but I should have read your comment first! Thanks for communicating precisely and concisely.

westurner 5y ago
While scoping is necessary and useful, I hadn't ever learned that there were categorical restrictions upon mind map graphs, definitionally Centrality, Components, Cliques might be helpful for general network analysis: https://networkx.org/documentation/stable/reference/algorithms/centrality.html https://networkx.org/documentation/stable/reference/algorith... The difference between a URI and a URL; a URL is supposed to be dereferenceable and retrievable. Named Graphs are composed of triples: {named_graph_uri, subject_uri, predicate_uri, value_uri, [datatype_uri, language_uri]} {g, s, p, o, [d, l]} E.g. Rdflib supports various stores for and representations of RDF: https://en.wikipedia.org/wiki/RDFLib https://en.wikipedia.org/wiki/RDFLib Though, general systems are more complex than the average [concept] network: there are nonlinearities in so many of the observed relations between components that trees and DAGs are laughably insufficient; systems descriptions require more than naievely-acyclical graphs without nonlinearity in independent relations even. Graph (disambiguation) https://en.wikipedia.org/wiki/Graph https://en.wikipedia.org/wiki/Graph Glossary of systems theory https://en.wikipedia.org/wiki/Glossary_of_systems_theory https://en.wikipedia.org/wiki/Glossary_of_systems_theory How best to describe nonlinear relations without a MultiDiGraph that bundles edges together by [QFT] field, because they're objectively not statistically independent?
- westurner 5y ago
  s/value_uri/object/, which may be a URI: {named_graph_uri, subject_uri, predicate_uri, object, [datatype_uri, language_uri]} {g, s, p, o, [d], [l]} A mindmap, where e.g. g=example.org/mind-maps/2022#our-mind-map and "a" is "xsd:type": @base <_#> . @prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> . @prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> . @prefix schema: <https://schema.org/> . :Node, a, rdfs:Class . :linksTo, a, rdfs:Property . :Shapes, a, :Node . :Shapes, :linksTo, :Rectangle . :Rectangle, a, :Node . :Rectangle, :linksTo, :Square . :Square, a, :Node . :Square, rdfs:label, "Square" . :Square, schema:name, "Square" . :Rectangle, rdfs:subClassOf, :Shape . :Square, rdfs:subClassOf, :Rectangle . https://en.wikipedia.org/wiki/Notation3#Comparison_of_Notation3,_Turtle,_and_N-Triples https://en.wikipedia.org/wiki/Notation3#Comparison_of_Notati... https://www.w3.org/TR/turtle/#sec-intro https://www.w3.org/TR/turtle/#sec-intro