@article{e648354f2c7c42ea84dd9e30a3b23574,
  title     = "Anytime classification by ontology approximation",
  abstract  = "Reasoning with large or complex ontologies is one of the bottle-necks of the Semantic Web. In this paper we present an anytime algorithm for classification based on approximate subsumption. We give the formal definitions for approximate subsumption, and show its monotonicity and soundness; we show how it can be computed in terms of classical subsumption; and we study the computational behaviour of the algorithm on a set of realistic benchmarks. The most interesting finding is that anytime classification works best on ontologies where classical subsumption is hardest to compute.",
  author    = "S. Schlobach and E. Blaauw and {El Kebir}, M. and {Ten Teije}, A. and {Van Harmelen}, F. and S. Bortoli and M.C. Hobbelman and K. Millian and Y. Ren and S. Stam and P. Thomassen and {Van Het Schip}, R. and {Van Willigem}, W.",
  year      = "2007",
  volume    = "291",
  journal   = "CEUR workshop proceedings",
  issn      = "1613-0073",
  publisher = "CEUR Workshop Proceedings",
}

{"_id":"7ZDSfGrEd6vbDLhgm","bibbaseid":"schlobach-blaauw-elkebir-tenteije-vanharmelen-bortoli-hobbelman-millian-etal-anytimeclassificationbyontologyapproximation-2007","downloads":0,"creationDate":"2017-10-10T08:05:28.884Z","title":"Anytime classification by ontology approximation","author_short":["Schlobach, S.","Blaauw, E.","El Kebir, M.","Ten Teije, A.","Van Harmelen, F.","Bortoli, S.","Hobbelman, M.","Millian, K.","Ren, Y.","Stam, S.","Thomassen, P.","Van Het Schip, R.","Van Willigem, W."],"year":2007,"bibtype":"article","biburl":"https://raw.githubusercontent.com/KRRVU/website/master/publications/krr.bib","bibdata":{"bibtype":"article","type":"article","title":"Anytime classification by ontology approximation","abstract":"Reasoning with large or complex ontologies is one of the bottle-necks of the Semantic Web. In this paper we present an anytime algorithm for classification based on approximate subsumption. We give the formal definitions for approximate subsumption, and show its monotonicity and soundness; we show how it can be computed in terms of classical subsumption; and we study the computational behaviour of the algorithm on a set of realistic benchmarks. The most interesting finding is that anytime classification works best on ontologies where classical subsumption is hardest to compute.","author":[{"firstnames":["S."],"propositions":[],"lastnames":["Schlobach"],"suffixes":[]},{"firstnames":["E."],"propositions":[],"lastnames":["Blaauw"],"suffixes":[]},{"propositions":[],"lastnames":["El Kebir"],"firstnames":["M."],"suffixes":[]},{"propositions":[],"lastnames":["Ten Teije"],"firstnames":["A."],"suffixes":[]},{"propositions":[],"lastnames":["Van Harmelen"],"firstnames":["F."],"suffixes":[]},{"firstnames":["S."],"propositions":[],"lastnames":["Bortoli"],"suffixes":[]},{"firstnames":["M.C."],"propositions":[],"lastnames":["Hobbelman"],"suffixes":[]},{"firstnames":["K."],"propositions":[],"lastnames":["Millian"],"suffixes":[]},{"firstnames":["Y."],"propositions":[],"lastnames":["Ren"],"suffixes":[]},{"firstnames":["S."],"propositions":[],"lastnames":["Stam"],"suffixes":[]},{"firstnames":["P."],"propositions":[],"lastnames":["Thomassen"],"suffixes":[]},{"propositions":[],"lastnames":["Van Het Schip"],"firstnames":["R."],"suffixes":[]},{"propositions":[],"lastnames":["Van Willigem"],"firstnames":["W."],"suffixes":[]}],"year":"2007","volume":"291","journal":"CEUR workshop proceedings","issn":"1613-0073","publisher":"CEUR Workshop Proceedings","bibtex":"@article{e648354f2c7c42ea84dd9e30a3b23574,\n title = \"Anytime classification by ontology approximation\",\n abstract = \"Reasoning with large or complex ontologies is one of the bottle-necks of the Semantic Web. In this paper we present an anytime algorithm for classification based on approximate subsumption. We give the formal definitions for approximate subsumption, and show its monotonicity and soundness; we show how it can be computed in terms of classical subsumption; and we study the computational behaviour of the algorithm on a set of realistic benchmarks. The most interesting finding is that anytime classification works best on ontologies where classical subsumption is hardest to compute.\",\n author = \"S. Schlobach and E. Blaauw and {El Kebir}, M. and {Ten Teije}, A. and {Van Harmelen}, F. and S. Bortoli and M.C. Hobbelman and K. Millian and Y. Ren and S. Stam and P. Thomassen and {Van Het Schip}, R. and {Van Willigem}, W.\",\n year = \"2007\",\n volume = \"291\",\n journal = \"CEUR workshop proceedings\",\n issn = \"1613-0073\",\n publisher = \"CEUR Workshop Proceedings\",\n}\n\n\n","author_short":["Schlobach, S.","Blaauw, E.","El Kebir, M.","Ten Teije, A.","Van Harmelen, F.","Bortoli, S.","Hobbelman, M.","Millian, K.","Ren, Y.","Stam, S.","Thomassen, P.","Van Het Schip, R.","Van Willigem, W."],"key":"e648354f2c7c42ea84dd9e30a3b23574","id":"e648354f2c7c42ea84dd9e30a3b23574","bibbaseid":"schlobach-blaauw-elkebir-tenteije-vanharmelen-bortoli-hobbelman-millian-etal-anytimeclassificationbyontologyapproximation-2007","role":"author","urls":{},"metadata":{"authorlinks":{}},"downloads":0},"search_terms":["anytime","classification","ontology","approximation","schlobach","blaauw","el kebir","ten teije","van harmelen","bortoli","hobbelman","millian","ren","stam","thomassen","van het schip","van willigem"],"keywords":[],"authorIDs":[],"dataSources":["H6xuGqu5uQ6rXhdJ4","dJmTXpbSWWjnxatYT"]}