|
Lightweight Ontologies
A lightweight ontology is an ontology or knowledge organization system in which concepts are connected by rather general associations than strict formal connections. Examples of lightweight ontologies include associative network and multilingual classifications but the term is not used consistently. Following the approach described in F. Giunchiglia, M. Marchese and I. Zaihrayeu (2006)Encoding classifications into lightweight ontologies University of Trento Technical Report # DIT-06-016, March 2006 and exploiting dedicated Natural language processing (NLP) techniques tuned to short phrases (for instance, as described in ), each node label can be translated into an unambiguous formal expression, i.e. into a propositional Description Logic (DL) expression. As a result, lightweight ontologies, or formal classifications, are tree-like structures where each node label is a language-independent propositional DL formula codifying the meaning of the node. Taking into account its context ( ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ontology (information Science)
In computer science and information science, an ontology encompasses a representation, formal naming, and definition of the categories, properties, and relations between the concepts, data, and entities that substantiate one, many, or all domains of discourse. More simply, an ontology is a way of showing the properties of a subject area and how they are related, by defining a set of concepts and categories that represent the subject. Every academic discipline or field creates ontologies to limit complexity and organize data into information and knowledge. Each uses ontological assumptions to frame explicit theories, research and applications. New ontologies may improve problem solving within that domain. Translating research papers within every field is a problem made easier when experts from different countries maintain a controlled vocabulary of jargon between each of their languages. For instance, the definition and ontology of economics is a primary concern in Marxist econo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Knowledge Organization System
Knowledge Organization Systems (KOS), concept system or concept scheme is a generic term used in knowledge organization for authority files, classification schemes, thesauri, topic maps, ontologies and similar works. Despite their differences in type, coverage and application all KOS aim to support the organization of knowledge and information to facilitate their management and retrieval. The core elements of most KOS can be expressed in RDF with the Simple Knowledge Organization System (SKOS). Many lists of KOS exist with BARTOC being the largest and most general one. See also *Library and information science *Library classification *Controlled vocabulary Control may refer to: Basic meanings Economics and business * Control (management), an element of management * Control, an element of management accounting * Comptroller (or controller), a senior financial officer in an organization * Controlling ... References Hodge, G. (2000). Systems of Knowledge Organization for Digital ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Natural Language Processing
Natural language processing (NLP) is an interdisciplinary subfield of linguistics, computer science, and artificial intelligence concerned with the interactions between computers and human language, in particular how to program computers to process and analyze large amounts of natural language data. The goal is a computer capable of "understanding" the contents of documents, including the contextual nuances of the language within them. The technology can then accurately extract information and insights contained in the documents as well as categorize and organize the documents themselves. Challenges in natural language processing frequently involve speech recognition, natural-language understanding, and natural-language generation. History Natural language processing has its roots in the 1950s. Already in 1950, Alan Turing published an article titled "Computing Machinery and Intelligence" which proposed what is now called the Turing test as a criterion of intelligence, t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hierarchy
A hierarchy (from Greek: , from , 'president of sacred rites') is an arrangement of items (objects, names, values, categories, etc.) that are represented as being "above", "below", or "at the same level as" one another. Hierarchy is an important concept in a wide variety of fields, such as architecture, philosophy, design, mathematics, computer science, organizational theory, systems theory, systematic biology, and the social sciences (especially political philosophy). A hierarchy can link entities either directly or indirectly, and either vertically or diagonally. The only direct links in a hierarchy, insofar as they are hierarchical, are to one's immediate superior or to one of one's subordinates, although a system that is largely hierarchical can also incorporate alternative hierarchies. Hierarchical links can extend "vertically" upwards or downwards via multiple links in the same direction, following a path. All parts of the hierarchy that are not linked vertically to one ano ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Decision Support System
A decision support system (DSS) is an information system that supports business or organizational decision-making activities. DSSs serve the management, operations and planning levels of an organization (usually mid and higher management) and help people make decisions about problems that may be rapidly changing and not easily specified in advance—i.e. unstructured and semi-structured decision problems. Decision support systems can be either fully computerized or human-powered, or a combination of both. While academics have perceived DSS as a tool to support decision making processes, DSS users see DSS as a tool to facilitate organizational processes. Some authors have extended the definition of DSS to include any system that might support decision making and some DSS include a decision-making software component; Sprague (1980)Sprague, R;(1980).A Framework for the Development of Decision Support Systems" MIS Quarterly. Vol. 4, No. 4, pp.1-25. defines a properly termed DSS as f ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ontology Alignment
Ontology alignment, or ontology matching, is the process of determining correspondences between concepts in ontologies. A set of correspondences is also called an alignment. The phrase takes on a slightly different meaning, in computer science, cognitive science or philosophy. Computer science For computer scientists, concepts are expressed as labels for data. Historically, the need for ontology alignment arose out of the need to integrate heterogeneous databases, ones developed independently and thus each having their own data vocabulary. In the Semantic Web context involving many actors providing their own ontologies, ontology matching has taken a critical place for helping heterogeneous resources to interoperate. Ontology alignment tools find classes of data that are semantically equivalent, for example, "truck" and "lorry". The classes are not necessarily logically identical. According to Euzenat and Shvaiko (2007),Jérôme Euzenat and Pavel Shvaiko. 2013Ontology matchin ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Semantic Matching
Semantic matching is a technique used in computer science to identify information which is semantically related. Given any two graph-like structures, e.g. classifications, taxonomies database or XML schemas and ontologies, matching is an operator which identifies those nodes in the two structures which semantically correspond to one another. For example, applied to file systems it can identify that a folder labeled "car" is semantically equivalent to another folder "automobile" because they are synonyms in English. This information can be taken from a linguistic resource like WordNet. In the recent years many of them have been offered. S-Match is an example of a ''semantic matching operator''. It works on lightweight ontologies, namely graph structures where each node is labeled by a natural language sentence, for example in English. These sentences are translated into a formal logical formula (according to an artificial unambiguous language) codifying the meaning of the node ta ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Semantic Integration
Semantic integration is the process of interrelating information from diverse sources, for example calendars and to do lists, email archives, presence information (physical, psychological, and social), documents of all sorts, contacts (including social graphs), search results, and advertising and marketing relevance derived from them. In this regard, semantics focuses on the organization of and action upon information by acting as an intermediary between heterogeneous data sources, which may conflict not only by structure but also context or value. Applications and methods In enterprise application integration (EAI), semantic integration can facilitate or even automate the communication between computer systems using metadata publishing. Metadata publishing potentially offers the ability to automatically link ontologies. One approach to (semi-)automated ontology mapping requires the definition of a semantic distance or its inverse, semantic similarity and appropriate rules. Othe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Minimal Mappings
Minimal mappings are the result of an advanced technique of semantic matching, a technique used in computer science to identify information which is semantically related. Semantic matching has been proposed as a valid solution to the semantic heterogeneity problem, namely, supporting diversity in knowledge. Given any two graph-like structures, e.g. classifications, databases, or XML schemas and ontologies, matching is an operator which identifies those nodes in the two structures that semantically correspond to one another. For example, applied to file systems, it can identify that a folder labeled “car” is semantically equivalent to another folder “automobile” because they are synonyms in English. The proposed technique works on lightweight ontologies, namely, tree structures where each node is labeled by a natural language sentence, for example in English. These sentences are translated into a formal logical formula (according to an unambiguous, artificial language). Th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
