@inproceedings{mitchell2015, author = {Mitchell, T. and Cohen, W. and Hruscha, E. and Talukdar, P. and Betteridge, J. and Carlson, A. and Dalvi, B. and Gardner, M. and Kisiel, B. and Krishnamurthy, J. and Lao, N. and Mazaitis, K. and Mohammad, T. and Nakashole, N. and Platanios, E. and Ritter, A. and Samadi, M. and Settles, B. and Wang, R. and Wijaya, D. and Gupta, A. and Chen, X. and Saparov, A. and Greaves, M. and Welling, J.}, title = {Never-Ending Learning}, booktitle = {AAAI}, year = {2015}, note = {: Never-Ending Learning in AAAI-2015}, url = {http://www.cs.cmu.edu/~wcohen/pubs.html}, keywords = {learning, nell, ontology, semantic, toread} }

%0 = inproceedings %A = Mitchell, T. and Cohen, W. and Hruscha, E. and Talukdar, P. and Betteridge, J. and Carlson, A. and Dalvi, B. and Gardner, M. and Kisiel, B. and Krishnamurthy, J. and Lao, N. and Mazaitis, K. and Mohammad, T. and Nakashole, N. and Platanios, E. and Ritter, A. and Samadi, M. and Settles, B. and Wang, R. and Wijaya, D. and Gupta, A. and Chen, X. and Saparov, A. and Greaves, M. and Welling, J. %B = AAAI %D = 2015 %T = Never-Ending Learning %U = http://www.cs.cmu.edu/~wcohen/pubs.html

@incollection{pol_introduction, author = {Lehmann, Jens and Voelker, Johanna}, title = {An Introduction to Ontology Learning}, editor = {Lehmann, Jens and Voelker, Johanna}, booktitle = {Perspectives on Ontology Learning}, publisher = {AKA / IOS Press}, year = {2014}, pages = {ix-xvi}, url = {http://jens-lehmann.org/files/2014/pol_introduction.pdf}, keywords = {introduction, learning, ontology} }

%0 = incollection %A = Lehmann, Jens and Voelker, Johanna %B = Perspectives on Ontology Learning %D = 2014 %I = AKA / IOS Press %T = An Introduction to Ontology Learning %U = http://jens-lehmann.org/files/2014/pol_introduction.pdf

@book{pan2013ontologydriven,, title = {Ontology-Driven Software Development}, editor = {Pan, Jeff Z.}, publisher = {Springer}, address = {Berlin [u.a.]}, year = {2013}, url = {http://scans.hebis.de/HEBCGI/show.pl?30954859_cov.jpg}, isbn = {9783642312250}, keywords = {ontology, driven, software, engineering, book} }

%0 = book %C = Berlin [u.a.] %D = 2013 %I = Springer %T = Ontology-Driven Software Development %U = http://scans.hebis.de/HEBCGI/show.pl?30954859_cov.jpg

With the rise of linked data, more and more semantically described information is being published online according to the principles and technologies of the Semantic Web (especially, RDF and SPARQL). The use of such standard technologies means that this data should be exploitable, integrable and reusable straight away. However, once a potentially interesting dataset has been discovered, significant efforts are currently required in order to understand its schema, its content, the way to query it and what it can answer. In this paper, we propose a method and a tool to automatically discover questions that can be answered by an RDF dataset. We use formal concept analysis to build a hierarchy of meaningful sets of entities from a dataset. These sets of entities represent answers, which common characteristics represent the clauses of the corresponding questions. This hierarchy can then be used as a querying interface, proposing questions of varying levels of granularity and specificity to the user. A major issue is however that thousands of questions can be included in this hierarchy. Based on an empirical analysis and using metrics inspired both from formal concept analysis and from ontology summarization, we devise an approach for identifying relevant questions to act as a starting point to the navigation in the question hierarchy.

@inproceedings{daquin2011extracting, author = {d'Aquin, Mathieu and Motta, Enrico}, title = {Extracting relevant questions to an RDF dataset using formal concept analysis}, booktitle = {Proceedings of the sixth international conference on Knowledge capture}, publisher = {ACM}, address = {New York, NY, USA}, year = {2011}, pages = {121--128}, url = {http://doi.acm.org/10.1145/1999676.1999698}, doi = {10.1145/1999676.1999698}, isbn = {978-1-4503-0396-5}, keywords = {analysis, concept, fca, formal, ontology, rdf, semantic, web}, abstract = {With the rise of linked data, more and more semantically described information is being published online according to the principles and technologies of the Semantic Web (especially, RDF and SPARQL). The use of such standard technologies means that this data should be exploitable, integrable and reusable straight away. However, once a potentially interesting dataset has been discovered, significant efforts are currently required in order to understand its schema, its content, the way to query it and what it can answer. In this paper, we propose a method and a tool to automatically discover questions that can be answered by an RDF dataset. We use formal concept analysis to build a hierarchy of meaningful sets of entities from a dataset. These sets of entities represent answers, which common characteristics represent the clauses of the corresponding questions. This hierarchy can then be used as a querying interface, proposing questions of varying levels of granularity and specificity to the user. A major issue is however that thousands of questions can be included in this hierarchy. Based on an empirical analysis and using metrics inspired both from formal concept analysis and from ontology summarization, we devise an approach for identifying relevant questions to act as a starting point to the navigation in the question hierarchy.} }

%0 = inproceedings %A = d'Aquin, Mathieu and Motta, Enrico %B = Proceedings of the sixth international conference on Knowledge capture %C = New York, NY, USA %D = 2011 %I = ACM %T = Extracting relevant questions to an RDF dataset using formal concept analysis %U = http://doi.acm.org/10.1145/1999676.1999698

@article{gasevic2011approach, author = {Gasevic, Dragan and Zouaq, Amal and Torniai, Carlo and Jovanovic, Jelena and Hatala, Marek}, title = {An Approach to Folksonomy-based Ontology Maintenance for Learning Environments}, journal = {IEEE Transactions on Learning Technologies}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, year = {2011}, volume = {99}, number = {1}, url = {http://www.computer.org/portal/web/csdl/doi/10.1109/TLT.2011.21}, doi = {10.1109/TLT.2011.21}, issn = {1939-1382}, keywords = {folksonomy, maintenance, ontology, tags} }

%0 = article %A = Gasevic, Dragan and Zouaq, Amal and Torniai, Carlo and Jovanovic, Jelena and Hatala, Marek %C = Los Alamitos, CA, USA %D = 2011 %I = IEEE Computer Society %T = An Approach to Folksonomy-based Ontology Maintenance for Learning Environments %U = http://www.computer.org/portal/web/csdl/doi/10.1109/TLT.2011.21

Learning structured representations has emerged as an important problem in many domains, including document and Web data mining, bioinformatics, and image analysis. One approach to learning complex structures is to integrate many smaller, incomplete and noisy structure fragments. In this work, we present an unsupervised probabilistic approach that extends affinity propagation to combine the small ontological fragments into a collection of integrated, consistent, and larger folksonomies. This is a challenging task because the method must aggregate similar structures while avoiding structural inconsistencies and handling noise. We validate the approach on a real-world social media dataset, comprised of shallow personal hierarchies specified by many individual users, collected from the photosharing website Flickr. Our empirical results show that our proposed approach is able to construct deeper and denser structures, compared to an approach using only the standard affinity propagation algorithm. Additionally, the approach yields better overall integration quality than a state-of-the-art approach based on incremental relational clustering.

@inproceedings{plangprasopchok2010probabilistic, author = {Plangprasopchok, Anon and Lerman, Kristina and Getoor, Lise}, title = {A Probabilistic Approach for Learning Folksonomies from Structured Data}, booktitle = {Proceedings of the 4th ACM Web Search and Data Mining Conference}, year = {2010}, note = {cite arxiv:1011.3557Comment: In Proceedings of the 4th ACM Web Search and Data Mining Conference (WSDM)}, url = {http://arxiv.org/abs/1011.3557}, keywords = {affinity_propagation, deletethistag, folksonomy, learning, ontology}, abstract = {Learning structured representations has emerged as an important problem in many domains, including document and Web data mining, bioinformatics, and image analysis. One approach to learning complex structures is to integrate many smaller, incomplete and noisy structure fragments. In this work, we present an unsupervised probabilistic approach that extends affinity propagation to combine the small ontological fragments into a collection of integrated, consistent, and larger folksonomies. This is a challenging task because the method must aggregate similar structures while avoiding structural inconsistencies and handling noise. We validate the approach on a real-world social media dataset, comprised of shallow personal hierarchies specified by many individual users, collected from the photosharing website Flickr. Our empirical results show that our proposed approach is able to construct deeper and denser structures, compared to an approach using only the standard affinity propagation algorithm. Additionally, the approach yields better overall integration quality than a state-of-the-art approach based on incremental relational clustering. } }

%0 = inproceedings %A = Plangprasopchok, Anon and Lerman, Kristina and Getoor, Lise %B = Proceedings of the 4th ACM Web Search and Data Mining Conference %D = 2010 %T = A Probabilistic Approach for Learning Folksonomies from Structured Data %U = http://arxiv.org/abs/1011.3557

Context awareness, dynamic reconfiguration at runtime and heterogeneity are key characteristics of future distributed systems, particularly in ubiquitous and mobile computing scenarios. The main contributions of this dissertation are theoretical as well as architectural concepts facilitating information exchange and fusion in heterogeneous and dynamic distributed environments. Our main focus is on bridging the heterogeneity issues and, at the same time, considering uncertain, imprecise and unreliable sensor information in information fusion and reasoning approaches. A domain ontology is used to establish a common vocabulary for the exchanged information. We thereby explicitly support different representations for the same kind of information and provide Inter-Representation Operations that convert between them. Special account is taken of the conversion of associated meta-data that express uncertainty and impreciseness. The Unscented Transformation, for example, is applied to propagate Gaussian normal distributions across highly non-linear Inter-Representation Operations. Uncertain sensor information is fused using the Dempster-Shafer Theory of Evidence as it allows explicit modelling of partial and complete ignorance. We also show how to incorporate the Dempster-Shafer Theory of Evidence into probabilistic reasoning schemes such as Hidden Markov Models in order to be able to consider the uncertainty of sensor information when deriving high-level information from low-level data. For all these concepts we provide architectural support as a guideline for developers of innovative information exchange and fusion infrastructures that are particularly targeted at heterogeneous dynamic environments. Two case studies serve as proof of concept. The first case study focuses on heterogeneous autonomous robots that have to spontaneously form a cooperative team in order to achieve a common goal. The second case study is concerned with an approach for user activity recognition which serves as baseline for a context-aware adaptive application. Both case studies demonstrate the viability and strengths of the proposed solution and emphasize that the Dempster-Shafer Theory of Evidence should be preferred to pure probability theory in applications involving non-linear Inter-Representation Operations.

@phdthesis{Reichle2010, author = {Reichle, Roland}, title = {Information Exchange and Fusion in Dynamic and Heterogeneous Distributed Environments}, school = {University of Kassel, Fachbereich 16: Elektrotechnik/Informatik, Distributed Systems Group}, address = {Wilhelmshöher Allee 73, 34121 Kassel, Germany}, year = {2010}, url = {http://kobra.bibliothek.uni-kassel.de/handle/urn:nbn:de:hebis:34-2010121035166}, keywords = {Heterogeneous, VENUS_VS, adaptation, computing, itegpub, mobile, myown, ontology, self-adaptive, ubiquitous}, abstract = {Context awareness, dynamic reconfiguration at runtime and heterogeneity are key characteristics of future distributed systems, particularly in ubiquitous and mobile computing scenarios. The main contributions of this dissertation are theoretical as well as architectural concepts facilitating information exchange and fusion in heterogeneous and dynamic distributed environments. Our main focus is on bridging the heterogeneity issues and, at the same time, considering uncertain, imprecise and unreliable sensor information in information fusion and reasoning approaches. A domain ontology is used to establish a common vocabulary for the exchanged information. We thereby explicitly support different representations for the same kind of information and provide Inter-Representation Operations that convert between them. Special account is taken of the conversion of associated meta-data that express uncertainty and impreciseness. The Unscented Transformation, for example, is applied to propagate Gaussian normal distributions across highly non-linear Inter-Representation Operations. Uncertain sensor information is fused using the Dempster-Shafer Theory of Evidence as it allows explicit modelling of partial and complete ignorance. We also show how to incorporate the Dempster-Shafer Theory of Evidence into probabilistic reasoning schemes such as Hidden Markov Models in order to be able to consider the uncertainty of sensor information when deriving high-level information from low-level data. For all these concepts we provide architectural support as a guideline for developers of innovative information exchange and fusion infrastructures that are particularly targeted at heterogeneous dynamic environments. Two case studies serve as proof of concept. The first case study focuses on heterogeneous autonomous robots that have to spontaneously form a cooperative team in order to achieve a common goal. The second case study is concerned with an approach for user activity recognition which serves as baseline for a context-aware adaptive application. Both case studies demonstrate the viability and strengths of the proposed solution and emphasize that the Dempster-Shafer Theory of Evidence should be preferred to pure probability theory in applications involving non-linear Inter-Representation Operations.} }

%0 = phdthesis %A = Reichle, Roland %C = Wilhelmshöher Allee 73, 34121 Kassel, Germany %D = 2010 %T = Information Exchange and Fusion in Dynamic and Heterogeneous Distributed Environments %U = http://kobra.bibliothek.uni-kassel.de/handle/urn:nbn:de:hebis:34-2010121035166

Folksonomies are becoming increasingly popular. They contain large amounts of data which can be mined and utilized for many tasks like visualization, browsing, information retrieval etc. An inherent problem of folksonomies is the lack of structure. In this paper we present an unsupervised approach for generating such structure based on a combination of association rule mining and the underlying tagged material. Using the underlying tagged material we generate a semantic representation of each tag. The semantic representation of the tags is an integral component of the structure generated. The experiment presented in this paper shows promising results with tag structures that correspond well with human judgment.

@incollection{solskinnsbakk2010hybrid, author = {Solskinnsbakk, Geir and Gulla, Jon}, title = {A Hybrid Approach to Constructing Tag Hierarchies}, editor = {Meersman, Robert and Dillon, Tharam and Herrero, Pilar}, booktitle = {On the Move to Meaningful Internet Systems, OTM 2010}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, address = {Berlin / Heidelberg}, year = {2010}, volume = {6427}, pages = {975-982}, url = {http://dx.doi.org/10.1007/978-3-642-16949-6_22}, doi = {10.1007/978-3-642-16949-6_22}, isbn = {978-3-642-16948-9}, keywords = {folksonomy, learning, ontology}, abstract = {Folksonomies are becoming increasingly popular. They contain large amounts of data which can be mined and utilized for many tasks like visualization, browsing, information retrieval etc. An inherent problem of folksonomies is the lack of structure. In this paper we present an unsupervised approach for generating such structure based on a combination of association rule mining and the underlying tagged material. Using the underlying tagged material we generate a semantic representation of each tag. The semantic representation of the tags is an integral component of the structure generated. The experiment presented in this paper shows promising results with tag structures that correspond well with human judgment.} }

%0 = incollection %A = Solskinnsbakk, Geir and Gulla, Jon %B = On the Move to Meaningful Internet Systems, OTM 2010 %C = Berlin / Heidelberg %D = 2010 %I = Springer %T = A Hybrid Approach to Constructing Tag Hierarchies %U = http://dx.doi.org/10.1007/978-3-642-16949-6_22

An ontology is a formal description of concepts and relationships that can exist for a community of human and/or machine agents. This book considers ontology languages, ontology engineering methods, example ontologies, infrastructures and technologies for ontologies, and how to bring this all into ontology-based infrastructures and applications.

@book{staab2009handbook, author = {Staab, Steffen and Studer, Rudi}, title = {Handbook on ontologies}, publisher = {Springer}, address = {Berlin}, year = {2009}, url = {http://public.eblib.com/choice/publicfullrecord.aspx?p=571805}, isbn = {9783540926733 3540926739}, keywords = {handbook, ontology, sota, survey}, abstract = {An ontology is a formal description of concepts and relationships that can exist for a community of human and/or machine agents. This book considers ontology languages, ontology engineering methods, example ontologies, infrastructures and technologies for ontologies, and how to bring this all into ontology-based infrastructures and applications.} }

%0 = book %A = Staab, Steffen and Studer, Rudi %C = Berlin %D = 2009 %I = Springer %T = Handbook on ontologies %U = http://public.eblib.com/choice/publicfullrecord.aspx?p=571805

@inproceedings{Kim2008, author = {Kim, Hak Lae and Scerri, Simon and Breslin, John G. and Decker, Stefan and Kim, Hong Gee}, title = {The State of the Art in Tag Ontologies: A Semantic Model for Tagging and Folksonomies}, booktitle = {Proceedings of the 2008 International Conference on Dublin Core and Metadata Applications}, publisher = {Dublin Core Metadata Initiative}, address = {Berlin, Deutschland}, year = {2008}, pages = {128--137}, keywords = {folksonomy, ontology, semantic, tag, tagging, taggingsurvey, toread} }

%0 = inproceedings %A = Kim, Hak Lae and Scerri, Simon and Breslin, John G. and Decker, Stefan and Kim, Hong Gee %B = Proceedings of the 2008 International Conference on Dublin Core and Metadata Applications %C = Berlin, Deutschland %D = 2008 %I = Dublin Core Metadata Initiative %T = The State of the Art in Tag Ontologies: A Semantic Model for Tagging and Folksonomies

We propose an approach for extending both the terminological and the assertional part of a Description Logic knowledge base by using information provided by the knowledge base and by a domain expert. The use of techniques from Formal Concept Analysis ensures that, on the one hand, the interaction with the expert is kept to a minimum, and, on the other hand, we can show that the extended knowledge base is complete in a certain, well-defined sense.

@inproceedings{baader2007completing, author = {Baader, Franz and Ganter, Bernhard and Sertkaya, Baris and Sattler, Ulrike}, title = {Completing description logic knowledge bases using formal concept analysis}, booktitle = {Proceedings of the 20th international joint conference on Artifical intelligence}, publisher = {Morgan Kaufmann Publishers Inc.}, address = {San Francisco, CA, USA}, year = {2007}, pages = {230--235}, url = {http://dl.acm.org/citation.cfm?id=1625275.1625311}, keywords = {analysis, base, complete, concept, description, dl, fca, formal, knowledge, logic, ontology}, abstract = {We propose an approach for extending both the terminological and the assertional part of a Description Logic knowledge base by using information provided by the knowledge base and by a domain expert. The use of techniques from Formal Concept Analysis ensures that, on the one hand, the interaction with the expert is kept to a minimum, and, on the other hand, we can show that the extended knowledge base is complete in a certain, well-defined sense.} }

%0 = inproceedings %A = Baader, Franz and Ganter, Bernhard and Sertkaya, Baris and Sattler, Ulrike %B = Proceedings of the 20th international joint conference on Artifical intelligence %C = San Francisco, CA, USA %D = 2007 %I = Morgan Kaufmann Publishers Inc. %T = Completing description logic knowledge bases using formal concept analysis %U = http://dl.acm.org/citation.cfm?id=1625275.1625311

We present YAGO, a light-weight and extensible ontology with high coverage and quality. YAGO builds on entities and relations and currently contains more than 1 million entities and 5 million facts. This includes the Is-A hierarchy as well as non-taxonomic relations between entities (such as HASONEPRIZE). The facts have been automatically extracted from Wikipedia and unified with WordNet, using a carefully designed combination of rule-based and heuristic methods described in this paper. The resulting knowledge base is a major step beyond WordNet: in <i>quality</i> by adding knowledge about individuals like persons, organizations, products, etc. with their semantic relationships - and in <i>quantity</i> by increasing the number of facts by more than an order of magnitude. Our empirical evaluation of fact correctness shows an accuracy of about 95%. YAGO is based on a logically clean model, which is decidable, extensible, and compatible with RDFS. Finally, we show how YAGO can be further extended by state-of-the-art information extraction techniques.

@inproceedings{suchanek2007semantic, author = {Suchanek, Fabian M. and Kasneci, Gjergji and Weikum, Gerhard}, title = {YAGO: a core of semantic knowledge}, booktitle = {Proceedings of the 16th international conference on World Wide Web}, publisher = {ACM}, address = {New York, NY, USA}, year = {2007}, pages = {697--706}, url = {http://doi.acm.org/10.1145/1242572.1242667}, doi = {10.1145/1242572.1242667}, isbn = {978-1-59593-654-7}, keywords = {data, knowledge, linked, lod, ontology, open, semantic, web, yago}, abstract = {We present YAGO, a light-weight and extensible ontology with high coverage and quality. YAGO builds on entities and relations and currently contains more than 1 million entities and 5 million facts. This includes the Is-A hierarchy as well as non-taxonomic relations between entities (such as HASONEPRIZE). The facts have been automatically extracted from Wikipedia and unified with WordNet, using a carefully designed combination of rule-based and heuristic methods described in this paper. The resulting knowledge base is a major step beyond WordNet: in <i>quality</i> by adding knowledge about individuals like persons, organizations, products, etc. with their semantic relationships - and in <i>quantity</i> by increasing the number of facts by more than an order of magnitude. Our empirical evaluation of fact correctness shows an accuracy of about 95%. YAGO is based on a logically clean model, which is decidable, extensible, and compatible with RDFS. Finally, we show how YAGO can be further extended by state-of-the-art information extraction techniques.} }

%0 = inproceedings %A = Suchanek, Fabian M. and Kasneci, Gjergji and Weikum, Gerhard %B = Proceedings of the 16th international conference on World Wide Web %C = New York, NY, USA %D = 2007 %I = ACM %T = YAGO: a core of semantic knowledge %U = http://doi.acm.org/10.1145/1242572.1242667

This research addresses the formation of new concepts and their corresponding ontology in a multi-agent system where individual autonomous agents try to learn new concepts by consulting several other agents. In this research individual agents create and learn their distinct conceptualization and rather than a commitment to a common ontology they use their own ontologies. In this paper multi-agent supervised learning of concepts among individual agents with diverse conceptualization and different ontologies is introduced and demonstrated through an intuitive example in which supervisors are other agents rather than a human.

@inproceedings{afsharchi2006automated, author = {Afsharchi, Mohsen and Far, Behrouz H.}, title = {Automated ontology evolution in a multi-agent system}, booktitle = {Proceedings of the 1st international conference on Scalable information systems}, series = {InfoScale '06}, publisher = {ACM}, address = {New York, NY, USA}, year = {2006}, url = {http://doi.acm.org/10.1145/1146847.1146863}, doi = {10.1145/1146847.1146863}, isbn = {1-59593-428-6}, keywords = {evolution, ontology, toread}, abstract = {This research addresses the formation of new concepts and their corresponding ontology in a multi-agent system where individual autonomous agents try to learn new concepts by consulting several other agents. In this research individual agents create and learn their distinct conceptualization and rather than a commitment to a common ontology they use their own ontologies. In this paper multi-agent supervised learning of concepts among individual agents with diverse conceptualization and different ontologies is introduced and demonstrated through an intuitive example in which supervisors are other agents rather than a human.} }

%0 = inproceedings %A = Afsharchi, Mohsen and Far, Behrouz H. %B = Proceedings of the 1st international conference on Scalable information systems %C = New York, NY, USA %D = 2006 %I = ACM %T = Automated ontology evolution in a multi-agent system %U = http://doi.acm.org/10.1145/1146847.1146863

In this paper we give a brief overview of different metadata mechanisms (like ontologies and folksonomies) and how they relate to each other. We identify major strengths and weaknesses of these mechanisms. We claim that these mechanisms can be classified from restricted (e.g., ontology) to free (e.g., free text tagging). In our view, these mechanisms should not be used in isolation, but rather as complementary solutions, in a continuous process wherein the strong points of one increase the semantic depth of the other. We give an overview of early active research already going on in this direction and propose that methodologies to support this process be developed. We demonstrate a possible approach, in which we mix tagging, taxonomy and ontology.

@inproceedings{christiaens2006metadata, author = {Christiaens, Stijn}, title = {Metadata Mechanisms: From Ontology to Folksonomy ... and Back}, booktitle = {Lecture Notes in Computer Science: On the Move to Meaningful Internet Systems 2006: OTM 2006 Workshops}, publisher = {Springer}, year = {2006}, url = {http://www.springerlink.com/content/m370107220473394}, keywords = {diploma_thesis, faceted_classification, folksonomy, folksonomy_background, ontology, semantic_web, tagging, ol_web2.0, background, widely_related}, abstract = {In this paper we give a brief overview of different metadata mechanisms (like ontologies and folksonomies) and how they relate to each other. We identify major strengths and weaknesses of these mechanisms. We claim that these mechanisms can be classified from restricted (e.g., ontology) to free (e.g., free text tagging). In our view, these mechanisms should not be used in isolation, but rather as complementary solutions, in a continuous process wherein the strong points of one increase the semantic depth of the other. We give an overview of early active research already going on in this direction and propose that methodologies to support this process be developed. We demonstrate a possible approach, in which we mix tagging, taxonomy and ontology.} }

%0 = inproceedings %A = Christiaens, Stijn %B = Lecture Notes in Computer Science: On the Move to Meaningful Internet Systems 2006: OTM 2006 Workshops %D = 2006 %I = Springer %T = Metadata Mechanisms: From Ontology to Folksonomy ... and Back %U = http://www.springerlink.com/content/m370107220473394

We argue for the usefulness of abductive reasoning in the context of ontologies. We discuss several applicaton scenarios in which various forms of abduction would be useful, introduce corresponding abductive reasoning tasks, give examples, and begin to develop the formal apparatus needed to employ abductive inference in expressive description logics.

@inproceedings{elsenbroich2006abductive, author = {Elsenbroich, Corinna and Kutz, Oliver and Sattler, Ulrike}, title = {A case for abductive reasoning over ontologies}, editor = {Grau, Bernardo Cuenca and Hitzler, Pascal and Shankey, Conor and Wallace, Evan}, booktitle = {Proceedings of the OWLED*06 Workshop on OWL: Experiences and Directions}, series = {CEUR-WS.org}, year = {2006}, volume = {216}, url = {http://www.cs.man.ac.uk/~okutz/case-for-abduction.pdf}, keywords = {inference, ontology, reasoning}, abstract = {We argue for the usefulness of abductive reasoning in the context of ontologies. We discuss several applicaton scenarios in which various forms of abduction would be useful, introduce corresponding abductive reasoning tasks, give examples, and begin to develop the formal apparatus needed to employ abductive inference in expressive description logics.} }

%0 = inproceedings %A = Elsenbroich, Corinna and Kutz, Oliver and Sattler, Ulrike %B = Proceedings of the OWLED*06 Workshop on OWL: Experiences and Directions %D = 2006 %T = A case for abductive reasoning over ontologies %U = http://www.cs.man.ac.uk/~okutz/case-for-abduction.pdf

A key argument for modeling knowledge in ontologies is the easy reuse and re-engineering of the knowledge. However, current ontology engineering tools provide only basic functionalities for analyzing ontologies. Since ontologies can be considered as graphs, graph analysis techniques are a suitable answer for this need. Graph analysis has been performed by sociologists for over 60 years, and resulted in the vivid research area of Social Network Analysis (SNA).While social network structures currently receive high attention in the Semantic Web community, there are only very few SNA applications, and virtually none for analyzing the structure of ontologies. We illustrate the benefits of applying SNA to ontologies and the Semantic Web, and discuss which research topics arise on the edge between the two areas. In particular, we discuss how different notions of centrality describe the core content and structure of an ontology. From the rather simple notion of degree centrality over betweenness centrality to the more complex eigenvector centrality, we illustrate the insights these measures provide on two ontologies, which are different in purpose, scope, and size.

@incollection{hoser2006semantic, author = {Hoser, Bettina and Hotho, Andreas and Jäschke, Robert and Schmitz, Christoph and Stumme, Gerd}, title = {Semantic Network Analysis of Ontologies}, editor = {Sure, York and Domingue, John}, booktitle = {The Semantic Web: Research and Applications}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, address = {Berlin/Heidelberg}, year = {2006}, volume = {4011}, pages = {514--529}, note = {10.1007/11762256_38}, url = {http://dx.doi.org/10.1007/11762256_38}, doi = {10.1007/11762256_38}, isbn = {978-3-540-34544-2}, keywords = {2006, iccs_example, l3s, myown, ontology, semantic, trias_example, sna, analysis, network, social}, abstract = { A key argument for modeling knowledge in ontologies is the easy reuse and re-engineering of the knowledge. However, current ontology engineering tools provide only basic functionalities for analyzing ontologies. Since ontologies can be considered as graphs, graph analysis techniques are a suitable answer for this need. Graph analysis has been performed by sociologists for over 60 years, and resulted in the vivid research area of Social Network Analysis (SNA).While social network structures currently receive high attention in the Semantic Web community, there are only very few SNA applications, and virtually none for analyzing the structure of ontologies. We illustrate the benefits of applying SNA to ontologies and the Semantic Web, and discuss which research topics arise on the edge between the two areas. In particular, we discuss how different notions of centrality describe the core content and structure of an ontology. From the rather simple notion of degree centrality over betweenness centrality to the more complex eigenvector centrality, we illustrate the insights these measures provide on two ontologies, which are different in purpose, scope, and size. } }

%0 = incollection %A = Hoser, Bettina and Hotho, Andreas and Jäschke, Robert and Schmitz, Christoph and Stumme, Gerd %B = The Semantic Web: Research and Applications %C = Berlin/Heidelberg %D = 2006 %I = Springer %T = Semantic Network Analysis of Ontologies %U = http://dx.doi.org/10.1007/11762256_38

Recently, research projects such as PADLR and SWAP
have developed tools like Edutella or Bibster, which are targeted at
establishing peer-to-peer knowledge management (P2PKM) systems. In
such a system, it is necessary to obtain provide brief semantic
descriptions of peers, so that routing algorithms or matchmaking
processes can make decisions about which communities peers should
belong to, or to which peers a given query should be forwarded.
This paper provides a graph clustering technique on
knowledge bases for that purpose. Using this clustering, we can show
that our strategy requires up to 58% fewer queries than the
baselines to yield full recall in a bibliographic P2PKM scenario.

@inproceedings{schmitz2006content, author = {Schmitz, Christoph and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd}, title = {Content Aggregation on Knowledge Bases using Graph Clustering}, editor = {Sure, York and Domingue, John}, booktitle = {The Semantic Web: Research and Applications}, series = {LNAI}, publisher = {Springer}, address = {Heidelberg}, year = {2006}, volume = {4011}, pages = {530-544}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2006/schmitz2006content.pdf}, keywords = {2006, aggregation, clustering, content, graph, itegpub, l3s, myown, nepomuk, ontologies, ontology, seminar2006, theory}, abstract = {Recently, research projects such as PADLR and SWAP
have developed tools like Edutella or Bibster, which are targeted at
establishing peer-to-peer knowledge management (P2PKM) systems. In
such a system, it is necessary to obtain provide brief semantic
descriptions of peers, so that routing algorithms or matchmaking
processes can make decisions about which communities peers should
belong to, or to which peers a given query should be forwarded.
This paper provides a graph clustering technique on
knowledge bases for that purpose. Using this clustering, we can show
that our strategy requires up to 58% fewer queries than the
baselines to yield full recall in a bibliographic P2PKM scenario.} }

%0 = inproceedings %A = Schmitz, Christoph and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd %B = The Semantic Web: Research and Applications %C = Heidelberg %D = 2006 %I = Springer %T = Content Aggregation on Knowledge Bases using Graph Clustering %U = http://www.kde.cs.uni-kassel.de/stumme/papers/2006/schmitz2006content.pdf

@inproceedings{conf/dagstuhl/Stumme05, author = {Stumme, Gerd}, title = {Ontology Merging with Formal Concept Analysis}, editor = {Kalfoglou, Yannis and Schorlemmer, W. Marco and Sheth, Amit P. and Staab, Steffen and Uschold, Michael}, booktitle = {Semantic Interoperability and Integration}, series = {Dagstuhl Seminar Proceedings}, publisher = {IBFI, Schloss Dagstuhl, Germany}, year = {2005}, volume = {04391}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2005/stumme2005ontology.pdf}, keywords = {2005, itegpub, l3s, merging, myown, ontology} }

%0 = inproceedings %A = Stumme, Gerd %B = Semantic Interoperability and Integration %D = 2005 %I = IBFI, Schloss Dagstuhl, Germany %T = Ontology Merging with Formal Concept Analysis %U = http://www.kde.cs.uni-kassel.de/stumme/papers/2005/stumme2005ontology.pdf

As ontology development becomes a more ubiquitous and collaborative process, ontology versioning and evolution becomes an important area of ontology research. The many similarities between database-schema evolution and ontology evolution will allow us to build on the extensive research in schema evolution. However, there are also important differences between database schemas and ontologies. The differences stem from different usage paradigms, the presence of explicit semantics and different knowledge models. A lot of problems that existed only in theory in database research come to the forefront as practical problems in ontology evolution. These differences have important implications for the development of ontology-evolution frameworks: The traditional distinction between versioning and evolution is not applicable to ontologies. There are several dimensions along which compatibility between versions must be considered. The set of change operations for ontologies is different. We must develop automatic techniques for finding similarities and differences between versions.

@article{noy2004ontology, author = {Noy, Natalya F. and Klein, Michel}, title = {Ontology Evolution: Not the Same as Schema Evolution}, journal = {Knowledge and Information Systems}, publisher = {Springer}, address = {London}, year = {2004}, volume = {6}, number = {4}, pages = {428--440}, url = {http://dx.doi.org/10.1007/s10115-003-0137-2}, doi = {10.1007/s10115-003-0137-2}, issn = {0219-1377}, keywords = {database, evolution, ontology, schema, semantic, web}, abstract = {As ontology development becomes a more ubiquitous and collaborative process, ontology versioning and evolution becomes an important area of ontology research. The many similarities between database-schema evolution and ontology evolution will allow us to build on the extensive research in schema evolution. However, there are also important differences between database schemas and ontologies. The differences stem from different usage paradigms, the presence of explicit semantics and different knowledge models. A lot of problems that existed only in theory in database research come to the forefront as practical problems in ontology evolution. These differences have important implications for the development of ontology-evolution frameworks: The traditional distinction between versioning and evolution is not applicable to ontologies. There are several dimensions along which compatibility between versions must be considered. The set of change operations for ontologies is different. We must develop automatic techniques for finding similarities and differences between versions.} }

%0 = article %A = Noy, Natalya F. and Klein, Michel %C = London %D = 2004 %I = Springer %T = Ontology Evolution: Not the Same as Schema Evolution %U = http://dx.doi.org/10.1007/s10115-003-0137-2

We describe a method for the automatic acquisition of the hyponymy lexical relation from unrestricted text. Two goals motivate the approach: (i) avoidance of the need for pre-encoded knowledge and (ii) applicability across a wide range of text. We identify a set of lexico-syntactic patterns that are easily recognizable, that occur frequently and across text genre boundaries, and that indisputably indicate the lexical relation of interest. We describe a method for discovering these patterns and suggest that other lexical relations will also be acquirable in this way. A subset of the acquisition algorithm is implemented and the results are used to augment and critique the structure of a large hand-built thesaurus. Extensions and applications to areas such as information retrieval are suggested.

@inproceedings{hearst1992automatic, author = {Hearst, Marti A.}, title = {Automatic acquisition of hyponyms from large text corpora}, booktitle = {Proceedings of the 14th conference on Computational linguistics}, publisher = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, year = {1992}, volume = {2}, pages = {539--545}, url = {http://dx.doi.org/10.3115/992133.992154}, doi = {10.3115/992133.992154}, keywords = {corpus, hearst, learning, linguistics, ontology, pattern, text}, abstract = {We describe a method for the automatic acquisition of the hyponymy lexical relation from unrestricted text. Two goals motivate the approach: (i) avoidance of the need for pre-encoded knowledge and (ii) applicability across a wide range of text. We identify a set of lexico-syntactic patterns that are easily recognizable, that occur frequently and across text genre boundaries, and that indisputably indicate the lexical relation of interest. We describe a method for discovering these patterns and suggest that other lexical relations will also be acquirable in this way. A subset of the acquisition algorithm is implemented and the results are used to augment and critique the structure of a large hand-built thesaurus. Extensions and applications to areas such as information retrieval are suggested.} }

%0 = inproceedings %A = Hearst, Marti A. %B = Proceedings of the 14th conference on Computational linguistics %C = Stroudsburg, PA, USA %D = 1992 %I = Association for Computational Linguistics %T = Automatic acquisition of hyponyms from large text corpora %U = http://dx.doi.org/10.3115/992133.992154