On 6/11/14 1:29 PM, Jack Park wrote:
> Kingsley, just curious: your short tutorial suggests that you believe
> I am saying otherwise. (01)
No. (02)
> What am I missing? (03)
I should have made it clear that I was addressing Frank Guerino's
question, which would be clearer if our email view is threaded, rather
than linear :-) (04)
Kingsley
>
> On Wed, Jun 11, 2014 at 10:16 AM, Kingsley Idehen
> <kidehen@xxxxxxxxxxxxxx> wrote:
>> On 6/11/14 11:59 AM, Frank Guerino wrote:
>>
>> Hi All,
>>
>> For a number of years, we've been working with Data Driven Synthesis as a
>> means of rapidly generating Data Networks/Graphs and the Knowledge
>> Constructs (e.g. Library Catalogs, Indexes, Taxonomies, Visualizations,
>> etc.) that help humans make easier & better sense of them (If interested,
>> see NOUNZ). Like many other Graph representations, we use "triples" or
>> "triplets" to help represent Semantic Relationships, where descriptive
>> Predicates are used as the binding between Subject Nodes and Object Nodes.
>>
>> To date, we've only treated Subjects and Objects as "Nodes" but we've always
>> known that we can (and have planned to) implement and treat Predicates as a
>> special type of "implicit" Node, as well. (Time didn’t' allow us to get to
>> doing so, until now.) We believe that doing so grants users of Graphs
>> certain benefits. We've identified three (3)…
>>
>> #1: The first and obvious advantage is that users can now enter a Graph from
>> any Edge/Predicate as easily as they can enter from any Node, and start to
>> traverse the Graph based on that point of entry.
>>
>> #2: The second advantage of treating Predicates as Nodes is that a Predicate
>> can now be used as an "Index" or "Pointer" that allows users to quickly find
>> all Nodes which are tied to said Predicate (or any Predicates that match
>> certain traits). In other words, it's a way of asking the Graph to quickly
>> identify all Nodes that are connected to a specific Edge/Link/Predicate (or
>> any of a common set of Predicate traits). This means that, in addition to
>> being able to ask "Node-oriented" questions of the Graph, you can now also
>> ask "Predicate/Edge-oriented" questions of the Graph, as well. This leads
>> to even more complex scenarios of being able to ask questions of, both,
>> Nodes and Edges.
>>
>> #3: The third advantage (based on the second) is that traversal of a Graph
>> can be even quicker, leading to even shorter paths, because instead of only
>> traversing a Graph from Node-to-Node-to-Node, through Nodes, users can now
>> traverse from any Edge/Predicate to any other Edge/Predicate, through
>> Edges/Predicates.
>>
>> My question to the Community: Aside from the above three, do you see any
>> other benefits that we're missing?
>>
>>
>> If each part of a statement (e.g., an RDF triple) is denoted by a
>> derefencable URI (e.g., an HTTP URI) you end up with a much deeper,
>> web-like, and logically comprehensible graph, to both humans and machines.
>> Generally, this concept is what's referred to as RDF [1] based Linked Data
>> [2] and the result is a Semantic Web [3].
>>
>> Links:
>>
>> [1] http://bit.ly/1fluti1 -- RDF described from my own Glossary of terms doc
>> (which in of itself is an RDF based Linked Data exploitation example)
>> [2] http://bit.ly/1frjVhu -- Linked Data
>> [3] http://bit.ly/1nxcpH9 -- Semantic Web .
>>
>> --
>>
>> Regards,
>>
>> Kingsley Idehen
>> Founder & CEO
>> OpenLink Software
>> Company Web: http://www.openlinksw.com
>> Personal Weblog: http://www.openlinksw.com/blog/~kidehen
>> Twitter Profile: https://twitter.com/kidehen
>> Google+ Profile: https://plus.google.com/+KingsleyIdehen/about
>> LinkedIn Profile: http://www.linkedin.com/in/kidehen
>>
>>
>>
>>
>>
>>
>> _________________________________________________________________
>> Message Archives: http://ontolog.cim3.net/forum/ontolog-forum/
>> Config Subscr: http://ontolog.cim3.net/mailman/listinfo/ontolog-forum/
>> Unsubscribe: mailto:ontolog-forum-leave@xxxxxxxxxxxxxxxx
>> Shared Files: http://ontolog.cim3.net/file/
>> Community Wiki: http://ontolog.cim3.net/wiki/
>> To join: http://ontolog.cim3.net/cgi-bin/wiki.pl?WikiHomePage#nid1J
>>
>
> _________________________________________________________________
> Message Archives: http://ontolog.cim3.net/forum/ontolog-forum/
> Config Subscr: http://ontolog.cim3.net/mailman/listinfo/ontolog-forum/
> Unsubscribe: mailto:ontolog-forum-leave@xxxxxxxxxxxxxxxx
> Shared Files: http://ontolog.cim3.net/file/
> Community Wiki: http://ontolog.cim3.net/wiki/
> To join: http://ontolog.cim3.net/cgi-bin/wiki.pl?WikiHomePage#nid1J
> (05)
-- (06)
Regards, (07)
Kingsley Idehen
Founder & CEO
OpenLink Software
Company Web: http://www.openlinksw.com
Personal Weblog: http://www.openlinksw.com/blog/~kidehen
Twitter Profile: https://twitter.com/kidehen
Google+ Profile: https://plus.google.com/+KingsleyIdehen/about
LinkedIn Profile: http://www.linkedin.com/in/kidehen (08)
smime.p7s
Description: S/MIME Cryptographic Signature
_________________________________________________________________
Message Archives: http://ontolog.cim3.net/forum/ontolog-forum/
Config Subscr: http://ontolog.cim3.net/mailman/listinfo/ontolog-forum/
Unsubscribe: mailto:ontolog-forum-leave@xxxxxxxxxxxxxxxx
Shared Files: http://ontolog.cim3.net/file/
Community Wiki: http://ontolog.cim3.net/wiki/
To join: http://ontolog.cim3.net/cgi-bin/wiki.pl?WikiHomePage#nid1J (01)
|