On Mon, Aug 22, 2016 at 7:53 PM, Ed Pell <[email protected]> wrote: > > With a graph we could mark each node with a sparse coded vector and sip > distant nodes on a first pass. If we have time and are "deep thinking" we > can consider more distant nodes. >
The opencog graphs are already represented as edges and vertexes, not vectors, so they are already sparse. The concept of distance that you refer to is called "attention", and "attention allocation" helps focus on those atoms that are important for achieving the current task. (Every atom has an attention value associated with it). --linas > > For more options, visit https://groups.google.com/d/optout. > -- You received this message because you are subscribed to the Google Groups "opencog" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/opencog. To view this discussion on the web visit https://groups.google.com/d/msgid/opencog/CAHrUA36i0O5kaMNSY5wY-zjiYKB6f5xXjreTShfpvgH4H3yKJA%40mail.gmail.com. For more options, visit https://groups.google.com/d/optout.
