Skip to main content
Erschienen in: Cluster Computing 2/2017

03.05.2017

Distance learning techniques for ontology similarity measuring and ontology mapping

verfasst von: Wei Gao, Mohammad Reza Farahani, Adnan Aslam, Sunilkumar Hosamani

Erschienen in: Cluster Computing | Ausgabe 2/2017

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Recent years, a large amount of ontology learning algorithms have been applied in different disciplines and engineering. The ontology model is presented as a graph and the key of ontology algorithms is similarity measuring between concepts. In the learning frameworks, the information of each ontology vertex is expressed as a vector, thus the similarity measuring can be determined via the distance of the corresponding vector. In this paper, we study how to get an optimal distance function in the ontology setting. The tricks we presented are divided into two parts: first, the ontology distance learning technology in the setting that the ontology data have no labels; then, the distance learning approaches in the setting that the given ontology data are carrying real numbers as their labels. The result data of the four simulation experiments reveal that our new ontology trick has high efficiency and accuracy in ontology similarity measure and ontology mapping in special engineering applications.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Kim, H.H., Lee, S.Y., Baik, S.Y., Kim, J.H.: MELLO: medical lifelog ontology for data terms from self-tracking and lifelog devices. Int. J. Med. Inform. 84(12), 1099–1110 (2015)CrossRef Kim, H.H., Lee, S.Y., Baik, S.Y., Kim, J.H.: MELLO: medical lifelog ontology for data terms from self-tracking and lifelog devices. Int. J. Med. Inform. 84(12), 1099–1110 (2015)CrossRef
2.
Zurück zum Zitat Slota, M., Leite, J., Swift, T.: On updates of hybrid knowledge bases composed of ontologies and rules. Nucleic Acids Res. 229, 33–104 (2015)MathSciNetMATH Slota, M., Leite, J., Swift, T.: On updates of hybrid knowledge bases composed of ontologies and rules. Nucleic Acids Res. 229, 33–104 (2015)MathSciNetMATH
3.
Zurück zum Zitat Azevedo, C.L.B., Iacob, M.E., Almeida, J.P.A., van Sinderen, M., Pires, L.F., Guizzardi, G.: Modeling resources and capabilities in enterprise architecture: a well-founded ontology-based proposal for archimate. Inf. Syst. 54, 235–262 (2015)CrossRef Azevedo, C.L.B., Iacob, M.E., Almeida, J.P.A., van Sinderen, M., Pires, L.F., Guizzardi, G.: Modeling resources and capabilities in enterprise architecture: a well-founded ontology-based proposal for archimate. Inf. Syst. 54, 235–262 (2015)CrossRef
4.
Zurück zum Zitat Nardi, J.C., Falbo, R.D., Almeida, J.P.A., Guizzardi, G., Pires, L.F., van Sinderen, M.J., Guarino, N., Fonseca, C.M.: A commitment-based reference ontology for services. Inf. Syst. 54, 263–288 (2015)CrossRef Nardi, J.C., Falbo, R.D., Almeida, J.P.A., Guizzardi, G., Pires, L.F., van Sinderen, M.J., Guarino, N., Fonseca, C.M.: A commitment-based reference ontology for services. Inf. Syst. 54, 263–288 (2015)CrossRef
5.
Zurück zum Zitat Wimmer, H., Rada, R.: Good versus bad knowledge: ontology guided evolutionary algorithms. Expert Syst. Appl. 42(21), 8039–8051 (2015)CrossRef Wimmer, H., Rada, R.: Good versus bad knowledge: ontology guided evolutionary algorithms. Expert Syst. Appl. 42(21), 8039–8051 (2015)CrossRef
6.
Zurück zum Zitat Herrmann-Pillath, C.: Energy, growth, and evolution: towards a naturalistic ontology of economics. Ecol. Econ. 119, 432–442 (2015)CrossRef Herrmann-Pillath, C.: Energy, growth, and evolution: towards a naturalistic ontology of economics. Ecol. Econ. 119, 432–442 (2015)CrossRef
7.
Zurück zum Zitat Dececchi, T.A., Balhoff, J.P., Lapp, H., Mabee, P.M.: Toward synthesizing our knowledge of morphology: using ontologies and machine reasoning to extract presence/absence evolutionary phenotypes across studies. Syst. Biol. 64(6), 936–952 (2015)CrossRef Dececchi, T.A., Balhoff, J.P., Lapp, H., Mabee, P.M.: Toward synthesizing our knowledge of morphology: using ontologies and machine reasoning to extract presence/absence evolutionary phenotypes across studies. Syst. Biol. 64(6), 936–952 (2015)CrossRef
8.
Zurück zum Zitat Santos, G.: Ontological emergence: how is that possible? towards a new relational ontology. Found. Sci. 20(4), 429–446 (2015)CrossRef Santos, G.: Ontological emergence: how is that possible? towards a new relational ontology. Found. Sci. 20(4), 429–446 (2015)CrossRef
9.
Zurück zum Zitat Morente-Molinera, J.A., Perez, I.J., Urena, M.R., Herrera-Viedma, E.: Building and managing fuzzy ontologies with heterogeneous linguistic information. Knowl. Syst. 88, 154–164 (2015)CrossRef Morente-Molinera, J.A., Perez, I.J., Urena, M.R., Herrera-Viedma, E.: Building and managing fuzzy ontologies with heterogeneous linguistic information. Knowl. Syst. 88, 154–164 (2015)CrossRef
10.
Zurück zum Zitat Santipantakis, G., Vouros, G.A.: Distributed reasoning with coupled ontologies: the E-SHIQ representation framework. Knowl. Inf. Syst. 45(2), 491–534 (2015)CrossRef Santipantakis, G., Vouros, G.A.: Distributed reasoning with coupled ontologies: the E-SHIQ representation framework. Knowl. Inf. Syst. 45(2), 491–534 (2015)CrossRef
11.
Zurück zum Zitat Wang, Y.Y., Gao, W., Zhang, Y.G., Gao, Y.: Ontology similarity computation use ranking learning method. In: The 3rd International Conference on Computational Intelligence and Industrial Application, pp. 20–22. Wuhan, China (2010) Wang, Y.Y., Gao, W., Zhang, Y.G., Gao, Y.: Ontology similarity computation use ranking learning method. In: The 3rd International Conference on Computational Intelligence and Industrial Application, pp. 20–22. Wuhan, China (2010)
12.
Zurück zum Zitat Huang, X., Xu, T.W., Gao, W., Jia, Z.Y.: Ontology similarity measure and ontology mapping via fast ranking method. Int. J. Appl. Phys. Math. 1(1), 54–59 (2011)CrossRef Huang, X., Xu, T.W., Gao, W., Jia, Z.Y.: Ontology similarity measure and ontology mapping via fast ranking method. Int. J. Appl. Phys. Math. 1(1), 54–59 (2011)CrossRef
13.
Zurück zum Zitat Gao, W., Liang, L.: Ontology similarity measure by optimizing NDCG measure and application in physics education. Future Commun. Comput. Control Manag. 142, 415–421 (2011)CrossRef Gao, W., Liang, L.: Ontology similarity measure by optimizing NDCG measure and application in physics education. Future Commun. Comput. Control Manag. 142, 415–421 (2011)CrossRef
14.
Zurück zum Zitat Gao, W., Guo, Y., Wang, K.Y.: Ontology algorithm using singular value decomposition and applied in multidisciplinary. Clust. Comput. 19(4), 2201–2210 (2016)CrossRef Gao, W., Guo, Y., Wang, K.Y.: Ontology algorithm using singular value decomposition and applied in multidisciplinary. Clust. Comput. 19(4), 2201–2210 (2016)CrossRef
15.
Zurück zum Zitat Gao, W., Gao, Y., Liang, L.: Diffusion and harmonic analysis on hypergraph and application in ontology similarity measure and ontology mapping. J. Chem. Pharm. Res. 5(9), 592–598 (2013) Gao, W., Gao, Y., Liang, L.: Diffusion and harmonic analysis on hypergraph and application in ontology similarity measure and ontology mapping. J. Chem. Pharm. Res. 5(9), 592–598 (2013)
16.
Zurück zum Zitat Gao, W., Baig, A.Q., Ali, H., Sajjad, W., Farahani, M.R.: Margin based ontology sparse vector learning algorithm and applied in biology science. Saudi J. Biol. Sci. 24(1), 132–138 (2017)CrossRef Gao, W., Baig, A.Q., Ali, H., Sajjad, W., Farahani, M.R.: Margin based ontology sparse vector learning algorithm and applied in biology science. Saudi J. Biol. Sci. 24(1), 132–138 (2017)CrossRef
17.
Zurück zum Zitat Gao, W., Zhu, L.L., Wang, K.Y.: Ranking based ontology scheming using eigenpair computation. J. Intell. Fuzzy Syst. 31(4), 2411–2419 (2016)CrossRef Gao, W., Zhu, L.L., Wang, K.Y.: Ranking based ontology scheming using eigenpair computation. J. Intell. Fuzzy Syst. 31(4), 2411–2419 (2016)CrossRef
18.
Zurück zum Zitat Gao, W., Gao, Y., Zhang, Y.G.: Strong and weak stability of \(k\)-partite ranking algorithm. Information 15(11(A)), 4585–4590 (2012)MathSciNetMATH Gao, W., Gao, Y., Zhang, Y.G.: Strong and weak stability of \(k\)-partite ranking algorithm. Information 15(11(A)), 4585–4590 (2012)MathSciNetMATH
19.
Zurück zum Zitat Gao, W., Farahani, M.R.: Generalization bounds and uniform bounds for multi-dividing ontology algorithms with convex ontology loss function. Comput. J. doi:10.1093/comjnl/bxw107 Gao, W., Farahani, M.R.: Generalization bounds and uniform bounds for multi-dividing ontology algorithms with convex ontology loss function. Comput. J. doi:10.​1093/​comjnl/​bxw107
20.
22.
Zurück zum Zitat Gao, W., Wang, W.F.: The eccentric connectivity polynomial of two classes of nanotubes. Chaos Solitons Fractals 89, 290–294 (2016)MathSciNetCrossRefMATH Gao, W., Wang, W.F.: The eccentric connectivity polynomial of two classes of nanotubes. Chaos Solitons Fractals 89, 290–294 (2016)MathSciNetCrossRefMATH
23.
Zurück zum Zitat Sachnev, V., Ramasamy, S., Sundaram, S., Kim, H.J., Hwang, H.J.: A cognitive ensemble of extreme learning machines for steganalysis based on risk-sensitive hinge loss function. Cogn. Comput. 7(1), 103–110 (2015)CrossRef Sachnev, V., Ramasamy, S., Sundaram, S., Kim, H.J., Hwang, H.J.: A cognitive ensemble of extreme learning machines for steganalysis based on risk-sensitive hinge loss function. Cogn. Comput. 7(1), 103–110 (2015)CrossRef
24.
Zurück zum Zitat Lee, C.P., Lin, C.J.: A study on L\(_{2}\)-loss (squared hinge-loss) multiclass SVM. Neural Comput. 25(5), 1302–1323 (2013)MathSciNetCrossRef Lee, C.P., Lin, C.J.: A study on L\(_{2}\)-loss (squared hinge-loss) multiclass SVM. Neural Comput. 25(5), 1302–1323 (2013)MathSciNetCrossRef
25.
Zurück zum Zitat Sen, M.U., Erdogan, H.: Linear classifier combination and selection using group sparse regularization and hinge loss. Pattern Recognit. Lett. 34(3), 265–274 (2013)CrossRef Sen, M.U., Erdogan, H.: Linear classifier combination and selection using group sparse regularization and hinge loss. Pattern Recognit. Lett. 34(3), 265–274 (2013)CrossRef
26.
Zurück zum Zitat Anguita, D., Ghio, A., Oneto, L., Ridella, S.: In-sample model selection for trimmed hinge loss support vector machine. Neural Process. Lett. 36(3), 275–283 (2012)CrossRef Anguita, D., Ghio, A., Oneto, L., Ridella, S.: In-sample model selection for trimmed hinge loss support vector machine. Neural Process. Lett. 36(3), 275–283 (2012)CrossRef
27.
Zurück zum Zitat Bartlett, P.L., Wegkamp, M.H.: Classification with a reject option using a hinge loss. J. Mach. Learn. Res. 9, 1823–1840 (2008)MathSciNetMATH Bartlett, P.L., Wegkamp, M.H.: Classification with a reject option using a hinge loss. J. Mach. Learn. Res. 9, 1823–1840 (2008)MathSciNetMATH
28.
Zurück zum Zitat Chassein, A.B., Goerigk, M.: A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem. Eur. J. Oper. Res. 244(3), 739–747 (2015)MathSciNetCrossRefMATH Chassein, A.B., Goerigk, M.: A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem. Eur. J. Oper. Res. 244(3), 739–747 (2015)MathSciNetCrossRefMATH
29.
Zurück zum Zitat Ehrgott, M., Ide, J., Schoebel, A.: Minmax robustness for multi-objective optimization problems. Eur. J. Oper. Res. 239(1), 17–31 (2014)MathSciNetCrossRefMATH Ehrgott, M., Ide, J., Schoebel, A.: Minmax robustness for multi-objective optimization problems. Eur. J. Oper. Res. 239(1), 17–31 (2014)MathSciNetCrossRefMATH
30.
Zurück zum Zitat Le, D.M., Le, Q.T.: On DC optimization algorithms for solving minmax flow problems. Math. Methods Oper. Res. 80(1), 83–97 (2014)MathSciNetCrossRefMATH Le, D.M., Le, Q.T.: On DC optimization algorithms for solving minmax flow problems. Math. Methods Oper. Res. 80(1), 83–97 (2014)MathSciNetCrossRefMATH
31.
Zurück zum Zitat Natarajan, K., Shi, D.J., Toh, K.C.: A probabilistic model for minmax regret in combinatorial optimization. Oper. Res. 62(1), 160–181 (2014)MathSciNetCrossRefMATH Natarajan, K., Shi, D.J., Toh, K.C.: A probabilistic model for minmax regret in combinatorial optimization. Oper. Res. 62(1), 160–181 (2014)MathSciNetCrossRefMATH
32.
33.
Zurück zum Zitat Candia-Vejar, A., Alvarez-Miranda, E., Maculan, N.: Minmax regret combinational optimization problems: an algorithmic perspective. Rairo-Oper. Res. 45(2), 101–129 (2011)MathSciNetCrossRefMATH Candia-Vejar, A., Alvarez-Miranda, E., Maculan, N.: Minmax regret combinational optimization problems: an algorithmic perspective. Rairo-Oper. Res. 45(2), 101–129 (2011)MathSciNetCrossRefMATH
34.
Zurück zum Zitat Kasperski, A., Zielinski, P.: Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights. Eur. J. Oper. Res. 200(3), 680–687 (2010)MathSciNetCrossRefMATH Kasperski, A., Zielinski, P.: Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights. Eur. J. Oper. Res. 200(3), 680–687 (2010)MathSciNetCrossRefMATH
35.
Zurück zum Zitat Kasperski, A., Zieliniski, P.: On the approximability of minmax (regret) network optimization problems. Inf. Process. Lett. 109(5), 262–266 (2009)MathSciNetCrossRefMATH Kasperski, A., Zieliniski, P.: On the approximability of minmax (regret) network optimization problems. Inf. Process. Lett. 109(5), 262–266 (2009)MathSciNetCrossRefMATH
36.
Zurück zum Zitat Sagol, G., Yildirim, E.A.: Analysis of copositive optimization based linear programming bounds on standard quadratic optimization. J. Global Optim. 63(1), 37–59 (2015)MathSciNetCrossRefMATH Sagol, G., Yildirim, E.A.: Analysis of copositive optimization based linear programming bounds on standard quadratic optimization. J. Global Optim. 63(1), 37–59 (2015)MathSciNetCrossRefMATH
37.
Zurück zum Zitat Atalay, K.D., Eraslan, E., Cinar, M.O.: A hybrid algorithm based on fuzzy linear regression analysis by quadratic programming for time estimation: An experimental study in manufacturing industry. J. Manufact. Syst. 36, 182–188 (2015)CrossRef Atalay, K.D., Eraslan, E., Cinar, M.O.: A hybrid algorithm based on fuzzy linear regression analysis by quadratic programming for time estimation: An experimental study in manufacturing industry. J. Manufact. Syst. 36, 182–188 (2015)CrossRef
38.
Zurück zum Zitat Saberian, F., Ghate, A., Kim, M.: A two-variable linear program solves the standard linear-quadratic formulation of the fractionation problem in cancer radiotherapy. Oper. Res. Lett. 43(3), 254–258 (2015)MathSciNetCrossRef Saberian, F., Ghate, A., Kim, M.: A two-variable linear program solves the standard linear-quadratic formulation of the fractionation problem in cancer radiotherapy. Oper. Res. Lett. 43(3), 254–258 (2015)MathSciNetCrossRef
39.
Zurück zum Zitat Hoang, N.T.: Linear convergence of a type of iterative sequences in nonconvex quadratic programming. J. Math. Anal. Appl. 423(2), 1311–1319 (2015)MathSciNetCrossRefMATH Hoang, N.T.: Linear convergence of a type of iterative sequences in nonconvex quadratic programming. J. Math. Anal. Appl. 423(2), 1311–1319 (2015)MathSciNetCrossRefMATH
40.
Zurück zum Zitat Adams, W., Waddell, L.: Linear programming insights into solvable cases of the quadratic assignment problem. Discret. Opt. 14, 46–60 (2014)MathSciNetCrossRefMATH Adams, W., Waddell, L.: Linear programming insights into solvable cases of the quadratic assignment problem. Discret. Opt. 14, 46–60 (2014)MathSciNetCrossRefMATH
41.
Zurück zum Zitat Craswell, N., Hawking, D.: Overview of the TREC: web track. In: Proceeding of the Twelfth Text Retrieval Conference, pp. 78–92, Gaithersburg, Maryland, NIST Special Publication(2003) Craswell, N., Hawking, D.: Overview of the TREC: web track. In: Proceeding of the Twelfth Text Retrieval Conference, pp. 78–92, Gaithersburg, Maryland, NIST Special Publication(2003)
42.
Zurück zum Zitat Gao, Y., Gao, W.: Ontology similarity measure and ontology mapping via learning optimization similarity function. Int. J. Mach. Learn. Comput. 2(2), 107–112 (2012)CrossRef Gao, Y., Gao, W.: Ontology similarity measure and ontology mapping via learning optimization similarity function. Int. J. Mach. Learn. Comput. 2(2), 107–112 (2012)CrossRef
43.
Zurück zum Zitat Gao, W., Lan, M.H.: Ontology mapping algorithm based on ranking learning method. Microelectron. Comput. 28(9), 59–61 (2011) Gao, W., Lan, M.H.: Ontology mapping algorithm based on ranking learning method. Microelectron. Comput. 28(9), 59–61 (2011)
Metadaten
Titel
Distance learning techniques for ontology similarity measuring and ontology mapping
verfasst von
Wei Gao
Mohammad Reza Farahani
Adnan Aslam
Sunilkumar Hosamani
Publikationsdatum
03.05.2017
Verlag
Springer US
Erschienen in
Cluster Computing / Ausgabe 2/2017
Print ISSN: 1386-7857
Elektronische ISSN: 1573-7543
DOI
https://doi.org/10.1007/s10586-017-0887-3

Weitere Artikel der Ausgabe 2/2017

Cluster Computing 2/2017 Zur Ausgabe