Posted:May 7, 2019

UMBEL - Upper Mapping and Binding Exchange Layer KBpedia is a More than Capable Successor

After nearly a dozen years of active service, we are retiring UMBEL (Upper Mapping and Binding Exchange Layer) at the end of the year. UMBEL was one of the first knowledge graphs designed to help disparate content interoperate on the Internet. It was based on the (also now-retired) OpenCyc version of the Cyc knowledge structure. Its development and use heavily influenced and informed the KBpedia knowledge graph, an improved successor designed to also support machine learning and knowledge-based artificial intelligence, or KBAI.

As of this announcement, all further development on UMBEL has ceased. It will be formally retired on December 31, 2019.

While Fred Giasson and I are ceasing our roles as editors of UMBEL and are ending our support of its Web sites and code, we would also be pleased to transfer any rights to the system, including UMBEL’s Web addresses and intellectual property, to any entity that is willing to keep these resources active. There may be users that may want to see the continuation of the system for their own purposes. The specific resources available are:

Realistically, with the emergence of KBpedia, we do not anticipate these resources to be in demand; nonetheless, we would be pleased to discuss transfer of these assets. Please contact me directly if you are interested.

UMBEL has been a great source of learning and a basis for many of our customer engagements over the past decade. UMBEL helped point us the way to ‘super types‘, the importance of disjointedness, the essential need for broad alternative labels (‘semsets‘), and the importance of a modular architecture and typologies. It is with much friendship and thanks that we bid adieu to UMBEL and its users and customers.

Posted by AI3's author, Mike Bergman Posted on May 7, 2019 at 9:46 pm in Big Structure, Ontologies, UMBEL | Comments (0)
The URI link reference to this post is: https://www.mkbergman.com/2229/umbel-to-be-retired-by-end-of-2019/
The URI to trackback this post is: https://www.mkbergman.com/2229/umbel-to-be-retired-by-end-of-2019/trackback/
Posted:April 15, 2019

KBpediaNew Release Includes Manually Vetted Wikidata Mapping

One of the reasons for releasing KBpedia as open source last October was the emerging usefulness of one its main constituent knowledge bases, Wikidata. Wikidata now contains about 45 million useful entities and concepts (so-called Q identifers) and more than a quarter billion data assertions across scores of languages [1]. Many of the efforts undertaken for KBpedia’s open-source release and others since then have been to increase coverage of Wikidata in KBpedia [2]. With the release of KBpedia v 2.10, we have extended the mappings to Wikidata instances to more than 98%. We also have increased coverage of other aspects of structure and properties within Wikidata to very high percentages. In this version 2.10 release we also manually inspected all 45,000 mappings of KBpedia reference concepts to Wikidata instances, resulting in many changes and improvements. The quality of mappings in KBpedia has never been higher.

KBpedia, as you recall, is a computable knowledge graph that sits astride Wikipedia and Wikidata and other leading knowledge bases. Its baseline 55,000 reference concepts provide a flexible and expandable means for relating your own data records to a common basis for reasoning and inferring logical relations and for mapping to virtually any external data source or schema. The framework is a clean starting basis for doing knowledge-based artificial intelligence (KBAI) and to train and use virtual agents. KBpedia combines seven major public knowledge bases — Wikipedia, Wikidata, schema.org, DBpedia, GeoNames, OpenCyc, and UMBEL. KBpedia supplements these core KBs with mappings to more than a score of additional leading vocabularies. The entire KBpedia structure is computable, meaning it can be reasoned over and logically sliced-and-diced to produce training sets and reference standards for machine learning and data interoperability. KBpedia provides a coherent overlay for retrieving and organizing Wikipedia or Wikidata content. KBpedia greatly reduces the time and effort traditionally required for KBAI tasks.

KBpedia is also a comprehensive knowledge structure for promoting data interoperability. KBpedia’s upper structure, the KBpedia Knowledge Ontology (KKO), is based on the universal categories and knowledge representation theories of the great 19th century American logician, philosopher, polymath and scientist, Charles Sanders Peirce. This design provides a logical and coherent underpinning to the entire KBpedia structure. The design is also modular and fairly straightforward to adapt to enterprise or domain purposes. KBpedia provides a powerful reference scaffolding for bringing together your own internal data stovepipes into a comprehensive whole. KBpedia, and extensions specific to your own domain needs, can be deployed incrementally, gaining benefits each step of the way, until you have a computable overlay tieing together all of your valuable information assets.

Major Activities for Version 2.10

Almost all efforts related to KBpedia v 2.10 were focused on Wikidata, though, with their close alliance, many changes also were reflected to the Wikipedia mappings. As noted with the v 2.00 release, the first effort we had was to map Q items (IDs) that have much instance coverage, but were lacking in prior mappings. This attention resulted in adding a net 973 Q IDs to KBpedia. This number is a bit misleading, however, since in the manual inspection phases many duplicates were removed from the system (approx. 2100) and earlier mappings to category Q IDs (approx. 2700) were upgraded to their more specific Q ID instance. Thus, nearly 6,000 Q IDs are now different in this version compared to the prior version 2.00. Since many of the Q IDs also have a direct mapping to a Wikipedia counterpart, these mappings were updated as well. Besides incidental improvements to definitions, linkages and labels that arise when doing such inspections, which were also attended to whenever encountered, no further major changes were made to this newest release.

We are now in very good shape with respect to our mapping and coverage of Wikidata (with a similar profile for Wikipedia). Across a breadth of measures, here is now where we stand with respect to Wikidata coverage [3], with implementation notes provided in the endnotes section:

Wikidata Item No. Items No. Mapped Items Coverage [3]
Q IDs 45,306,576 45,882 00.1% [4]
Q instances 45,306,576 44,458,015 98.1% [4]
Q classes 2,493,795 2,312,116 92.7% [5]
Properties 5,910 3,970 67.2% [6]
P Statements 256,298,963 246,055,199 96.0% [7]
P Qualifiers 38,866,255 31,756,937 81.7% [7,8]
P References 24,582,259 20,121,794 81.9% [7,9]

One of the first observations that jumps out of the table is how relatively few mappings (~ 45 K, or 0.1%) are sufficient to capture nearly all (98%) of the instances contained in Wikidata. This is because a Q ID may be an individual instance or a parent to multiple instances. The KBpedia mappings focus on the parents, through which the individual instances may be obtained. By virtue of the additions and Q mapping improvements in this version, KBpedia has expanded its instance reach from about 30 million entities to now 45 million entities.

Another observation is that we are also capturing a significant portion of the structure of Wikidata (93%) as provided by the mappings to Q IDs with significant subClassOf connections (P279), which is where the taxonomy of the knowledge base is defined. A third summary observation is that we have similarly high levels of coverage to Wikidata properties. However, at present, this is the least developed area of KBpedia with respect to use cases or cross-knowledge base mappings.

A minor change, but useful to the KBpedia Web site, has been our downgrading of the OpenCyc and UMBEL mapped items. They are still mapped in the knowledge structure, but the Web site removes their links in order to highlight the most popular knowledge bases.

Despite these upgrades and enhancements, the coverage of KBpedia in my new book, A Knowledge Representation Practionary: Guidelines Based on Charles Sanders Peirce (Springer), remains current. The book emphasizes theory, architecture and design, which remains unchanged in this current new release of KBpedia. Also note that future areas of improvement were listed in the KBpedia v 2.00 release notice.

Getting the System

The KBpedia Web site provides a working KBpedia explorer and demo of how the system may be applied to local content for tagging or analysis. KBpedia splits between entities and concepts, on the one hand, and splits in predicates based on attributes, external relations, and pointers or indexes, all informed by Charles Peirce’s prescient theories of knowledge representation.

Mappings to all external sources are provided in the linkages to the external resources file in the KBpedia downloads. (A larger inferred version is also available.) The external sources keep their own record files. KBpedia distributions provide the links. However, you can access these entities through the KBpedia explorer on the project’s Web site (see these entity examples for cameras, cakes, and canyons; clicking on any of the individual entity links will bring up the full instance record. Such reach-throughs are straightforward to construct.)

Here are the various KBpedia resources that you may download or use for free with attribution:

  • The complete KBpedia v 210 knowledge graph (8.5 MB, zipped). This download is likely your most useful starting point
  • KBpedia’s upper ontology, KKO (332 KB), which is easily inspected and navigated in an editor
  • The annotated KKO (321 KB). This is NOT an active ontology, but is has the upper concepts annotated to more clearly show the Peircean categories of Firstness (1ns), Secondness (2ns), and Thirdness (3ns)
  • The 68 individual KBpedia typologies in N3 format
  • The KBpedia mappings to the seven core knowledge bases and the additional extended knowledge bases in N3 format
  • A version of the full KBpedia knowledge graph extended with linkages to the external resources (10.5 MB, zipped), and
  • A version of the full KBpedia knowledge graph extended with inferences and linkages (14.7 MB, zipped).

The last two resources require time and sufficient memory to load. We invite and welcome contributions or commentary on any of these resources.

All resources are available under the Creative Commons Attribution 4.0 International (CC BY 4.0) license. KBpedia’s development to date has been sponsored by Cognonto Corporation. We welcome suggestions for further enhancements or tackling your own improvements. Please let me know what ideas you may have.

Notes

[1] Useful mappings exclude mappings to internal Wikimedia sources (such as templates, categories, or infoboxes on Wikipedia and Wikidata) and scholarly articles (linked in other manners). There are about 45 million ‘useful’ records in the current Wikipedia based on these filters.
[2] ‘Coverage’ is understood to be the percentage of useful instances in a source knowledge base to KBpedia that are actually mapped to a specific KBpedia reference concept or property. These source instances are not included in the KBpedia distribution. They are accessed from the source knowledge base directly. Manipulation of the KBpedia knowledge graph results in the identification of this external source data.
[3] The number of items shown for Wikidata does not reflect the total items on the service, but only those that are useful and relevant after administrative categories and such are removed.
[4] See the text where we describe how choosing to map appropriate structural nodes in Wikidata, which themselves have many child instances, leads to large percentage coverage of all available instances. Instance relationships are obtained from the P31 Wikidata property. The Q IDs were obtained from a Feb 19, 2019 Wikidata retrieval.
[5] Like the instance (P31) retrievals, the subClassOf (P279) data was obtained by a SPARQL query to the Wikidata query endpoint. Try it!
[6] The properties data was obtained from the SQID Wikidata service on April 4, 2019. Note, if you try this link, be patient for all of the data to load.
[7] A Wikidata statement pairs a property with a value for a given entity. It is equivalent to an assertion. It is the most basic factual statement in Wikidata.
[8] Wikidata qualifiers allow statements to be expanded on, annotated, or contextualized beyond what can be expressed in just a simple property-value pair.
[9] Wikidata references are used to point to specific sources that back up the data provided in a statement.
Posted:April 9, 2019

A Knowledge Representation Practionary$25 to SpringerLink Subscribers

After resolving some technical glitches, Springer has finally made available my new book, A Knowledge Representation Practionary: Guidelines Based on Charles Sanders Peirce, in paperback form. The 464 pp book is available for $24.99 under Springer’s MyCopy program.

MyCopy is available to SpringerLink subscribers who have access to the computer science collection. Most universities and larger tech firms and knowledge organizations are current subscribers. You should be able to login to your local library, go to SpringerLink, and then search for A Knowledge Representation Practionary. If you are a qualified subscriber, you will see the image to the right on the results page.MyCopy Banner (If you are not a subscriber, you should be able to find a friend or colleague who is and repeat this process using their account.) After choosing to buy, you will be guided through the standard transaction screens.

As Springer states, “MyCopy books are only offered to patrons of a library with access to at least one Springer Nature eBook subject collection and are strictly for individual use only.” 

Though only printed in monochrome, my figures render well and the quality is quite high. The cover is in color and the paper quality is high. I waited to get a copy myself before I could recommend it. I think the overall quality is quite good.

To learn more about my AKRP book, including a listing of the table of contents, see the initial announcement. Also, of course, Springer subscribers have access to the free eBook, and hardcopy and other versions are available. Unfortunately, I think prices are unreasonably high for non-Springer subscribers. Please let me know if you need to find a cheaper alternative.

BTW, if you read and like my book (or even otherwise!), I encourage you to provide your rating to Goodreads.

Posted:March 24, 2019

KBpediaAfter First Twitch, How to Learn More About KBpedia

My last installment in this introductory series to KBpedia discussed loading the main knowledge graph into an editor for inspection and navigation. I characterized this look as a ‘first twitch.’ Now, I’d like to accompany that view with a walk around KBpedia to gain more perspective on its use and purpose.

The standard introduction to KBpedia on its Web site states:

KBpedia is a comprehensive knowledge structure for promoting data interoperability and knowledge-based artificial intelligence, or KBAI. The KBpedia knowledge structure combines seven ‘core’ public knowledge bases — Wikipedia, Wikidata, schema.org, DBpedia, GeoNames, OpenCyc, and UMBEL — into an integrated whole. KBpedia’s upper structure, or knowledge graph, is the KBpedia Knowledge Ontology. We base KKO on the universal categories and knowledge representation theories of the great 19th century American logician, polymath and scientist, Charles Sanders Peirce.

KBpedia, written primarily in OWL 2, includes 55,000 reference concepts, mapped linkages to about 32 million entities (most from Wikidata), and 5,000 relations and properties, all organized according to about 70 modular typologies that can be readily substituted or expanded. We test candidates added to KBpedia using a rigorous (but still fallible) suite of logic and consistency tests — and best practices — before acceptance. The result is a flexible and computable knowledge graph that can be sliced-and-diced and configured for all sorts of machine learning tasks, including supervised, unsupervised and deep learning.

So, short of loading and implementing the system locally, let me outline the online resources that can help explain KBpedia more.

One Kind of Demo

One of the uses — among potentially dozens — of a controlled vocabulary is to tag content for consistent characterization and categorization. In the example below, found off of the Demo link on KBpedia.org, I have submitted my last introductory blog post on KBpedia to the online demo system:

Main Demo Screen

Figure 1: KBpedia Demo Screen

The tagger uses the 55,000 concepts in KBpedia to tag content. One can also see a listing of entities and various analysis of the content. A general tutorial covers the use and interpretation of the online demo function.

Explore the Knowledge Graph

The main online resource for KBpedia is the knowledge graph itself. The knowledge graph may be navigated and searched, including with advanced search functions. The basic knowledge graph is organized under the upper-level KBpedia Knowledge Ontology, or KKO. KKO is itself organized according to about 80 typologies of similar concepts and entities, mostly organized as being distinct from one another. The high-level view of this knowledge graph is shown by:

Upper-level Typologies of KBpedia

Figure 2: Upper-level of the KBpedia Knowledge Graph

There are two detailed use guides and tutorials governing how to navigate and search the graph. The first is How to Use the Knowledge Graph and the second is Knowledge Graph Search. These provide insight into the various capabilities of the online knowledge graph and its search functions.

Check Out the Use Cases

Of course, tagging is not the only function available for leveraging the KBpedia knowledge graph. Remember, the three principal purposes for KBpedia are to support general knowledge management; to aid data interoperability; and to be a foundational basis for knowledge-based artificial intelligence (KBAI). These purposes are described more fully in a series of use cases.

Knowledge Graph

These are the KBpedia use cases related to the use and browsing of the knowledge graph:

Machine Learning Use Cases

KBpedia, combined with your own schema and data, can provide a nearly automated foundation for creating trainng corpuses and training sets for deep learning, unsupervised learning, and supervised learning. Further, these same selection capabilities, combined with the logical basis of the KBpedia knowledge graph, also aid the creation of reference standards. Reference standards are essential for tuning analysis parameters to obtain the best results for your tagging or categorization efforts. Tuning parameters are integral to most forms of natural language processing and for supervised learning.

Mapping Use Cases

Mapping is an essential consideration for two reasons. The first rationale for mapping is to create a consistent and coherent knowledge structure over which to reason and conduct machine learning. The second rationale is to consolidate local information resources, what is known as data integration. The easiest way to meet both of these rationales is to leverage off an existing knowledge structure, which itself is already proven to be logically consistent. This is the role that KBpedia plays. When extended with your local concepts and terminology, your enterprise extension of KBpedia now itself becomes a consistent structure for learning, tagging and categorization. Here are some of the current use cases published for KBpedia relevant to mapping:

Learn More

The Resources tab on the KBpedia Web site provides additional documentation on the system. Specifically, under Additional Documentation are these useful sources:

Upon review of the materials above, you should be well-armed to understand more about KBpedia and its purposes. Beyond these online resources, the next steps are to download and install the system and begin work with it!

Posted:February 27, 2019

KBpediaHere’s the Best Starting Point to Learn About the Knowledge Graph

I’ve always favored a way to describe the first successful operation of a computer program as ‘first twitch.’ It brings to mind the stirrings of Dr. Frankenstein’s monster when first zapped with electricity. It is the moment when we first see how something works, and that it might continue to work into the future.

The ‘monster’ on the table for today’s exercise is KBpedia, which I have been talking about much recently since we released it as open source in late 2018. KBpedia is a computable knowledge graph that sits astride Wikipedia and Wikidata and other leading knowledge bases. Its baseline 55,000 reference concepts provide a flexible and expandable means for relating your own data records to a common basis for reasoning and inferring logical relations and for mapping to virtually any external data source or schema. The framework is an increasingly clean starting basis for doing knowledge-based artificial intelligence (KBAI) and to train and use virtual agents. KBpedia combines seven major public knowledge bases — Wikipedia, Wikidata, schema.org, DBpedia, GeoNames, OpenCyc, and UMBEL.

It is mighty hard to describe knowledge graphs or ontologies in the abstract. This difficulty is especially hard when trying to convey a knowledge graph to someone who is not familiar with semantic technologies and tools. Thus, while in subsequent posts over the coming weeks I will dive into more details, my purpose today is to help those with little background to put in in place a sufficient basis to gain their own ‘first twitch’ for KBpedia. We will do so with only a small portion of the KBpedia distribution package and an open-source tool called Protégé. Hopefully, with about 15-30 min of effort, you can set up your own local environment to get KBpedia to twitch. (Five min if you already have Protégé installed.)

It’s alive!

Getting Set Up

We will begin our familiarization using only two files from the open source KBpedia distribution package. First, go to the KBpedia GitHub repository and download the two files of the kko.n3 and kbpedia_reference_concepts.zip. In the case of kko.n3, which is the small upper ontology for KBpedia, you will copy-and-paste the code to a local file and name it the same. In the case of kbpedia_reference_concepts.zip, which contains the main substance of KBpedia, you should download the file and then unzip it in a directory you can find on your local machine. The unzipped file is called kbpedia_reference_concepts.n3. For simplicity, put this and kko.n3 file into the same directory. (In our production settings we use multiple sub-directories.)

Second, you will need to download and install Protégé, an open-source ontology development framework with more than 300,000 users. (There are other ontology viewers or development frameworks that can readily run KBpedia, but Protégé is the most widely used, free one.) Go to the Protégé download page and follow the instructions for your particular operating system. You should fill out the new user registration (though you can claim you are already registered and still download it directly). The version I installed for this example is version 5.5 beta (though any of the version 5.2 forward should be fine as well.) The Protégé distribution comes as a zip file, so you should unzip it into a directory of your choice. To complete the set-up you will also need the most recent version of Java installed on your machine; it you do not have it, here are installation instructions.

Next, to start up Protégé, invoke the executable in your Protégé directory. It will take a few seconds for the program to load. Once the main screen appears, go to File and then Open, and then navigate to the directory to where you stored kbpedia_reference_concepts.n3. Pick that file and click the Open button.

The first time you load KBpedia you are likely to get the following error message:

Possible Loading Error

Figure 1: Possible Error Message Upon Loading

Follow the instructions on the screen to find the second needed file, kko.n3, which I just suggested you store in the same directory. (Once you save your current session, the next time you start up this error will not appear.) Also, next you work with the system, you can open KBpedia by using the File → Open Recent option. Lastly, you may encounter some performance or display issues. I conclude this article with a couple of use tips for Protégé.

Taking the Tour

Upon successful start-up, you will see the Protégé main screen as shown in Figure 2. Let me briefly cover some of the main conventions of the program. The three key structural aspects of the Protégé program are its main menu, its tab structure, and the views (or panes) shown for each tab where it appears on the standard interface ( ). At start-up we always begin at the Active ontology tab, for which I highlight some of its key panes and functionality:

Main Protégé Screen

Figure 2: Main KBpedia Screen on Protégé

The ontology header section ( ) is where all of the metadata for the knowledge graph resides. Such material includes title, creators, version notes and so forth. The metrics for the ontology resides in the second view ( ). We see, for example, that this expression of KBpedia has more than 54,000 classes (reference concepts) and more than 5,000 properties. We also see in the third view ( ) that KBpedia requires the SKOS and KKO ontology imports. Also note the search button ( ), which we will use frequently, and the tab structure and order ( ). We will modify that structure in our next set of steps.

Because Protégé, like many integrated development environments (IDEs), is highly configurable, let’s detour for a short step to see how we can modify how our program looks. I am going to delete and add tabs to make the tab structure conform to the remaining screen shots.

To change tabs in Protégé, let’s refer to Figure 3:

Adding Tab Views

Figure 3: Adding Tab Views to Protégé

We effect the general layout of the system using the Window → Tabs option from the main menu. You delete a tab by clicking on the arrow shown for each tab as presented in the standard interface. You add tabs by selecting one of the options in the Tabs menu ( ). Note that active tabs are indicated by the checkmark ( ). New tabs are added to the right of the tab sequence ( ). Thus, to change the ordering of tabs, one must delete and then add tabs in the order desired. You can follow these steps if you want the tab ordering to reflect the screen shots below.

[This same main menu Window option is where you can change the views (panes) for each tab. However, we don’t discuss that customization further in this article.]

Discovering and Inspecting Reference Concepts

When your tabs are to your liking, let’s begin inspecting KBpedia itself. Let’s first move to the Classes tab screen, the most important to understanding the hierarchy and structure of KBpedia. Note when we change tabs that the border colors also change. Each tab in Protégé is demarked with its own color.  The actual class structure is shown in the left-hand pane ( ) in Figure 4. The tree structure may be expanded or collapsed by clicking on the triangles shown for a given item (items without the triangle are terminal nodes).  The direction the triangle points indicates the expand or collapse mode. Depending on your Protégé settings, the default opening for this tree may be expanded (by levels) or collapsed. What we are showing in Figure 4 is the highest structure of KBpedia, which can also be separately inspected with the kko.n3 file alone. (Peirce scholars and ontologists may prefer to start there.)

Because KBpedia is an organized, computable structure of types (classes), the majority of the items in KBpedia may be found under the SuperTypes branch ( ). This is where you will spend most of your time inspecting the existing 55 K reference concepts (RCs).

Another thing to note is the multi-paned structure of the layout ( ), which I noted before. These panes are configurable, and may be moved and resized at any location across the tab. Figure 4 is close to the default Protégé settings.

Initial Class View

Figure 4: Initial View from the Class Tab

Search ( ) is one of the most important functions in the system, since it is the primary way to find specific RCs when there are thousands. Search is also useful for all other information in the system. Given this importance, let’s take another short detour to the search screen. Click search.

That brings up the search screen, as shown in the next Figure 5. There is some interesting functionality here, worth calling out individually. Let’s begin a search for ‘mammal’:

Class View Using 'Mammal'

Figure 5: Class View After Doing A ‘Mammal’ Search

As we enter the search term, only ‘mamma’ so far in the case shown, there is a lookahead (auto-complete) function to match the entered text ( ), beginning with three characters. It is also important to note there are some pretty powerful search options ( ); I often use the Show all results choice, though sometimes lists can grow to be huge! (Using few search characters for common letter combinations, for example).

The search screen organizes its results into multiple categories ( ) (scroll down), including descriptions and annotations. The most important matches, namely to preferred labels and IRIs, appear at the top of the listing. It is also possible to highlight results on these lists and create copies ( ) for posting to the clipboard. I use this functionality frequently.

Once we have selected ‘Mammal’ from the search results list, the search screen remains open (useful for testing many putative matches), and the tree in the Class view updates and more RC results are automatically displayed, as Figure 6 shows (in this case, I have closed the search screen so as to not obscure the main screen):

Class View Using 'Mammal'

Figure 6: Class View After Doing A ‘Mammal’ Search

We now see a much-expanded tree in the left Class hierarchy pane ( ). We can again click the triangles to collapse or expand that portion of the tree.

For the selected item in the tree, again ‘Mammal’ in this case, we can see its annotations and linkage relationships ( ), including labels, descriptions, notes and links. The Descriptions pane ( ) shows us the formal relationships and other assertions for this RC in the knowledge graph. (Since we are not working with all KBpedia files, this portion may not be as complete as when all files are included.)

Thie general process can be repeated over and over to gain an understanding. You can navigate the tree via scrolling and expanding and collapsing nodes, or searching for terms or stems as you encounter then. Of course, both navigation and searching are done concurrently during discovery mode. It is this process, in my view, that best leads to first twitch for KBpedia by better understanding the structure, scope and relationships for the graph’s 55 K reference concepts.

Discovering and Inspecting Properties

These same conventions and approaches may also be used for understanding the properties (relations) in KBpedia, as I show in Figure 7. First, note ( ) we have split our properties into three groups: object properties, data properties, and annotation properties:

Initial Object Property View

Figure 7: Initial View from the Object Property Tab

These are the standard splits in the OWL language. How we use these splits and their relation to the guidance of Charles Sanders Peirce is described in another article. In essence, object properties are those that connect to an item (with a URI or IRI) already in the system; data properties are literal strings and descriptions connected to the subject item; and annotation properties are those that describe or point to the item. We’ll just use an object property example here, though the use and navigation applies to the other two property categories as well

The Object properties tab in Figure 7 also has a search function ( ), exactly similar to what was described for classes. We also see a tree structure at the left that works the same as for classes ( ). However, besides the relations splits due to Peirce, there are two other major property differences for KBpedia compared to most knowledge graphs or ontologies. The first difference is the sheer number of properties, more than 5 K in the case of KBpedia. The second is the logical organization of those properties, beginning with the three splits due to Peirce, but extending down to an emerging, logical hierarchy of property types.

To see some of this, let’s do a search for the property ‘color’ [( ) in Figure 7]. The result, again working similar to what we saw for classes, I show in Figure 8:

Object Property View Using 'Color'

Figure 8: Object Property View for ‘color’

Like before, we now see an expanded tree highlighting the ‘color’ property ( ), again accompanied by metadata and other structural aspects of the Object properties ( ).

As before, you can use a combination of scrolling, tree expansions and searching to discover the properties in KBpedia. Do make sure and check out the Data properties and Annotation properties tabs as well.

Performance and Preferences

You very well may experience some performance issues with Protégé as it comes out of the box. One likely cause are the memory settings that you may find in the run.bat file that you can find in the main directory where you installed Protégé. As a quick fix, try updating these settings in that file to these values before the next time you start the application:

-Xmx2500M -Xms2000M

Also note there are many customization options in Protégé. If you get captivated with the tool, I encourage you to explore the plugins available and the ways to modify the application interface. See especially File → Preferences, with the Renderer and Plugin tabs good places to look.

The Framework is a Beginning

These two files are at the core of KBpedia, but do not constitute its entirety. These two files are likely the simplest, adequate representation for entering the KBpedia construct.

I will be talking in coming weeks about additional aspects of discovering what is in KBpedia and how it may be used. We’ll be talking about working with the system, use cases, and how to discover more about the system using the KBpedia Web site. I do think, however, that the basic inspections of the system outlined here are one of the better ways to get familiar and feel a twitch with the system.

There are many moving parts in KBpedia and much interconnection. We are constantly finding and fixing errors in addition to improving the scope of the system. Should you encounter questionable assignments or missing relationships, please do let us know. We welcome all suggestions for improvements and commit to continued quality improvements and releases.