Abstract
Several applications require the matching of user profiles, e.g., job recruitment or dating systems. In this paper we present a logical framework for specifying user profiles that allows profile description to be incomplete in the parts that are unavailable or are considered irrelevant by the user. We present an algorithm for matching demands and supplies of profiles, taking into account incompleteness of profiles and incompatibility between demand and supply. We specialize our framework to dating services; however, the same techniques can be directly applied to several other contexts.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press, Cambridge (2003)
Baader, F., Hanschke, P.: A schema for integrating concrete domains into concept languages. In: Proc. of IJCAI 1991, pp. 452–457 (1991)
Borgida, A., Patel-Schneider, P.F.: A semantics and complete algorithm for subsumption in the CLASSIC description logic. J. of Artificial Intelligence Research 1, 277–308 (1994)
Colucci, S., Di Noia, T., Di Sciascio, E., Donini, F.M., Mongiello, M.: Concept abduction and contraction in description logics. In: Proc. of DL 2003. CEUR Electronic Workshop Proceedings (2003), http://ceur-ws.org/Vol-81/
Colucci, S., Di Noia, T., Di Sciascio, E., Donini, F.M., Mongiello, M., Mottola, M.: A formal approach to ontology-based semantic match of skills descriptions. J. of Universal Computer Science, Special issue on Skills Management (2003)
Di Noia, T., Di Sciascio, E., Donini, F.M., Mongiello, M.: Abductive matchmaking using description logics. In: Proc. of IJCAI 2003, pp. 337–342 (2003)
Di Noia, T., Di Sciascio, E., Donini, F.M., Mongiello, M.: A system for principled matchmaking in an electronic marketplace. In: Proc. of WWW 2003, May 20–24, pp. 321–330 (2003)
Galil, Z.: Efficient algorithms for finding maximum matching in graphs. ACM Computing Surveys 18(1), 23–38 (1986)
Hillier, F.S., Lieberman, G.J.: Introduction to Operations Research. McGraw-Hill, New York (1995)
Kennington, J., Wang, Z.: An empirical analysis of the dense assignment problem: Sequential and parallel implementations. ORSA Journal on Computing 3(4), 299–306 (1991)
Kuokka, D., Harada, L.: Integrating information via matchmaking. J. of Intelligent Information Systems 6, 261–279 (1996)
Sycara, K., Widoff, S., Klusch, M., Lu, J.: LARKS: Dynamic matchmaking among heterogeneus ssoftware agents in cyberspace. Autonomous agents and multi-agent systems 5, 173–203 (2002)
Veit, D., Müller, J.P., Schneider, M., Fiehn, B.: Matchmaking for autonomous agents in electronic marketplaces. In: Proc. of AGENTS 2001, pp. 65–66. ACM, New York (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Calì, A., Calvanese, D., Colucci, S., Di Noia, T., Donini, F.M. (2004). A Logic-Based Approach for Matching User Profiles. In: Negoita, M.G., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2004. Lecture Notes in Computer Science(), vol 3215. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30134-9_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-30134-9_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23205-6
Online ISBN: 978-3-540-30134-9
eBook Packages: Springer Book Archive