Skip to main content
Top

2021 | OriginalPaper | Chapter

8. Concept-Based Learning of Complainants’ Behavior

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

In this chapter, we apply concept learning techniques to solve a number of problems in the customer relationship management (CRM) domain. We present a concept learning technique for common scenarios of interaction between conflicting human agents. Customer complaints are classified as valid (requiring some kind of compensation) or invalid (requiring reassuring and calming down) the customer. Scenarios are represented by directed graphs with labeled vertices (for communicative actions) and arcs (for temporal and causal relationships between these actions and their parameters). The classification of a scenario is computed by comparing a partial matching of its graph with graphs of positive and negative examples. We illustrate machine learning of graph structures using the Nearest Neighbor approach and then proceed to JSM-based concept learning, which minimizes the number of false negatives and takes advantage of a more accurate way of matching sequences of communicative actions. Scenario representation and comparative analysis techniques developed herein are applied to the classification of textual customer complaints as a CRM component. In order to estimate complaint validity, we take advantage of the observation (Galitsky and Kuznetsov 2008) that analyzing the structure of communicative actions without context information is frequently sufficient to judge how humans explain their behavior. Therefore, because human attitudes are domain-independent, the proposed concept learning technique is a good compliment to a wide range of CRM technologies where a formal treatment of inter-human interactions such as customer complaints is required in a decision-support mode.

Dont have a licence yet? Then find out more about our products and how to get one now:

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!

Literature
go back to reference Austin JL (1962) How to do things with words. In: Urmson JO (ed). Clarendon, Oxford Austin JL (1962) How to do things with words. In: Urmson JO (ed). Clarendon, Oxford
go back to reference Bach K, Harnish RM (1979) Linguistic communication and speech acts. MIT Press, Cambridge, MA Bach K, Harnish RM (1979) Linguistic communication and speech acts. MIT Press, Cambridge, MA
go back to reference Barwise J (1975) Admissible sets and structures. Springer Verlag Barwise J (1975) Admissible sets and structures. Springer Verlag
go back to reference Barwise J, Perry J (1983) Situations and attitudes. MIT Press, Cambridge, MA and LondonMATH Barwise J, Perry J (1983) Situations and attitudes. MIT Press, Cambridge, MA and LondonMATH
go back to reference Barwise J, Seligman J (2000) Information flow in distributed systems. Cambridge University Press, Tracts in Theoretical Computer Science Barwise J, Seligman J (2000) Information flow in distributed systems. Cambridge University Press, Tracts in Theoretical Computer Science
go back to reference Bratman ME (1987) Intention, plans and practical reason. Harvard University Press Bratman ME (1987) Intention, plans and practical reason. Harvard University Press
go back to reference Bichler M, Kiss C (2004) A comparison of logistic regression, k-nearest neighbor, and decision tree induction for campaign management. Tenth Americas Conference on Information Systems (AMCIS), New York Bichler M, Kiss C (2004) A comparison of logistic regression, k-nearest neighbor, and decision tree induction for campaign management. Tenth Americas Conference on Information Systems (AMCIS), New York
go back to reference Chaovalit P, Zhou L (2005) Movie review mining: a comparison between supervised and unsupervised classification approaches. In: Proceedings of the Hawaii International Conference on System Sciences (HICSS) Chaovalit P, Zhou L (2005) Movie review mining: a comparison between supervised and unsupervised classification approaches. In: Proceedings of the Hawaii International Conference on System Sciences (HICSS)
go back to reference Coble J, Cook D, Rathi R, Holder L (2005) Iterative structure discovery in graph-based data. Int J Art Int Techn 1–2(14):101–124CrossRef Coble J, Cook D, Rathi R, Holder L (2005) Iterative structure discovery in graph-based data. Int J Art Int Techn 1–2(14):101–124CrossRef
go back to reference Cohen PR, Levesque HJ (1990) Performatives in a rationally based speech act theory. In: Proceedings of the 28th conference of Association for Computational Linguistics, pp 79–88 Cohen PR, Levesque HJ (1990) Performatives in a rationally based speech act theory. In: Proceedings of the 28th conference of Association for Computational Linguistics, pp 79–88
go back to reference Davidow M (2003) Organizational responses to customer complaints: what works and what doesn’t. J Ser Res 5(3):225–250CrossRef Davidow M (2003) Organizational responses to customer complaints: what works and what doesn’t. J Ser Res 5(3):225–250CrossRef
go back to reference Dierkes T, Bichler M, Krishnan R (2009) Modelling network effects with markov logic networks for churn prediction in the telecommunication industry. In: Fifth Symposium on Statistical Challenges in Electronic Commerce Research Dierkes T, Bichler M, Krishnan R (2009) Modelling network effects with markov logic networks for churn prediction in the telecommunication industry. In: Fifth Symposium on Statistical Challenges in Electronic Commerce Research
go back to reference Finn VK (1991) Plausible reasoning in systems of JSM-type, Itogi Nauki I Techniki, Seriya Informatika, 15:54–101, [in Russian] Finn VK (1991) Plausible reasoning in systems of JSM-type, Itogi Nauki I Techniki, Seriya Informatika, 15:54–101, [in Russian]
go back to reference Finn VK (1999) On the synthesis of cognitive procedures and the problem of induction NTI Series 2 N1-2 8-45.12 Finn VK (1999) On the synthesis of cognitive procedures and the problem of induction NTI Series 2 N1-2 8-45.12
go back to reference Galitsky B (2006) Reasoning about mental attitudes of complaining customers. Knowledge-Based Systems Galitsky B (2006) Reasoning about mental attitudes of complaining customers. Knowledge-Based Systems
go back to reference Galitsky B (2008) Kuznetsov SO: learning communicative actions of conflicting human agents. J Exp Theor Artif Intell 20(4):277–317 Galitsky B (2008) Kuznetsov SO: learning communicative actions of conflicting human agents. J Exp Theor Artif Intell 20(4):277–317
go back to reference Galitsky B (2016a) Generalization of parse trees for iterative taxonomy learning. Inf Sci 329:125–143 Galitsky B (2016a) Generalization of parse trees for iterative taxonomy learning. Inf Sci 329:125–143
go back to reference Galitsky B (2016b) Computational models of Autism. In: Computational Autism, Springer, Cham, Switzerland, pp 17–77 Galitsky B (2016b) Computational models of Autism. In: Computational Autism, Springer, Cham, Switzerland, pp 17–77
go back to reference Galitsky B (2018) Customers’ retention requires an explainability feature in machine learning systems they use. 2018 AAAI Spring Symposium Series Galitsky B (2018) Customers’ retention requires an explainability feature in machine learning systems they use. 2018 AAAI Spring Symposium Series
go back to reference Galitsky B (2019a) Enabling a bot with understanding argumentation and providing arguments. Developing Enterprise Chatbots, Springer, Cham, Switzerland, pp 465–532 Galitsky B (2019a) Enabling a bot with understanding argumentation and providing arguments. Developing Enterprise Chatbots, Springer, Cham, Switzerland, pp 465–532
go back to reference Galitsky B (2019b) Enabling chatbots by validating argumentation. US Patent App. 16/260,939 Galitsky B (2019b) Enabling chatbots by validating argumentation. US Patent App. 16/260,939
go back to reference Galitsky B, Tumarkina I (2004) Justification of customer complaints using emotional states and mental actions. FLAIRS conference, Miami, Florida Galitsky B, Tumarkina I (2004) Justification of customer complaints using emotional states and mental actions. FLAIRS conference, Miami, Florida
go back to reference Galitsky B, Miller A (2005) Determining possible criminal behavior of mobile phone users by means of analysing the location tracking data, AAAI SSS 2005 on Homeland Security Galitsky B, Miller A (2005) Determining possible criminal behavior of mobile phone users by means of analysing the location tracking data, AAAI SSS 2005 on Homeland Security
go back to reference Galitsky B, Pascu A (2006) Epistemic Categorization for Analysis of Customer Complaints. FLAIRS Conference, 291–296 Galitsky B, Pascu A (2006) Epistemic Categorization for Analysis of Customer Complaints. FLAIRS Conference, 291–296
go back to reference Galitsky B, Kuznetsov SO (2008b) Scenario argument structure vs individual claim defeasibility: what is more important for validity assessment? Intl. Conf on Concept Structures ICCS 2008: 282–296 LNCS 5113 Galitsky B, Kuznetsov SO (2008b) Scenario argument structure vs individual claim defeasibility: what is more important for validity assessment? Intl. Conf on Concept Structures ICCS 2008: 282–296 LNCS 5113
go back to reference Galitsky B, Parnis A (2019) Accessing validity of argumentation of agents of the internet of everything. In: Artificial Intelligence for the Internet of Everything, pp 187–216 Galitsky B, Parnis A (2019) Accessing validity of argumentation of agents of the internet of everything. In: Artificial Intelligence for the Internet of Everything, pp 187–216
go back to reference Galitsky B, Ilvovsky D (2019) Validating correctness of textual explanation with complete discourse trees. In: Workshop Notes of the Seventh International Workshop” What can FCA do for AI” Galitsky B, Ilvovsky D (2019) Validating correctness of textual explanation with complete discourse trees. In: Workshop Notes of the Seventh International Workshop” What can FCA do for AI”
go back to reference Galitsky B, Kuznetsov SO, Samokhin MV (2005) Analyzing conflicts with concept-based learning. International conference on conceptual structures, pp 307–322 Galitsky B, Kuznetsov SO, Samokhin MV (2005) Analyzing conflicts with concept-based learning. International conference on conceptual structures, pp 307–322
go back to reference Galitsky BA, Kuznetsov SO, Vinogradov DV (2006) Applying hybrid reasoning to mine for associative features in biological data. J Biomed Inform v22 Galitsky BA, Kuznetsov SO, Vinogradov DV (2006) Applying hybrid reasoning to mine for associative features in biological data. J Biomed Inform v22
go back to reference Galitsky B, Chen H, Du S (2009a) Inversion of forum content based on authors’ sentiments on product usability. AAAI Spring Symposium: Social Semantic Web: Where Web 2.0 Meets Web 3.0, pp 33–38 Galitsky B, Chen H, Du S (2009a) Inversion of forum content based on authors’ sentiments on product usability. AAAI Spring Symposium: Social Semantic Web: Where Web 2.0 Meets Web 3.0, pp 33–38
go back to reference Galitsky B, González MP, Chesñevar CI (2009b) A novel approach for classifying customer complaints through graphs similarities in argumentative dialogues. Decis Support Syst 46(3):717–729CrossRef Galitsky B, González MP, Chesñevar CI (2009b) A novel approach for classifying customer complaints through graphs similarities in argumentative dialogues. Decis Support Syst 46(3):717–729CrossRef
go back to reference Galitsky B, Kovalerchuk B, Kuznetsov SO (2007) Learning common outcomes of communicative actions represented by labeled graphs. In: Intl Conference on Concept Structures Sheffield UK July 22–27 LNCS 4604, pp 387–400 Galitsky B, Kovalerchuk B, Kuznetsov SO (2007) Learning common outcomes of communicative actions represented by labeled graphs. In: Intl Conference on Concept Structures Sheffield UK July 22–27 LNCS 4604, pp 387–400
go back to reference Galitsky B, D Ilvovsky, SO Kuznetsov SO (2015) Text integrity assessment: sentiment profile vs rhetoric structure international conference on intelligent text processing and computational linguistics, pp 126–139 Galitsky B, D Ilvovsky, SO Kuznetsov SO (2015) Text integrity assessment: sentiment profile vs rhetoric structure international conference on intelligent text processing and computational linguistics, pp 126–139
go back to reference Galitsky B, Ilvovsky D, Kuznetsov SO (2018) Detecting logical argumentation in text via communicative discourse tree. J Exp Theor Artif Intell 30(5):1–27CrossRef Galitsky B, Ilvovsky D, Kuznetsov SO (2018) Detecting logical argumentation in text via communicative discourse tree. J Exp Theor Artif Intell 30(5):1–27CrossRef
go back to reference Galitsky B, Dobrocsi G, De La Rosa JL, Kuznetsov SO (2010) From generalization of syntactic parse trees to conceptual graphs. In: International conference on conceptual structures, pp 185–190 Galitsky B, Dobrocsi G, De La Rosa JL, Kuznetsov SO (2010) From generalization of syntactic parse trees to conceptual graphs. In: International conference on conceptual structures, pp 185–190
go back to reference Galitsky B, Dobrocsi G, de la Rosa JL, Kuznetsov SO (2011) Using generalization of syntactic parse trees for taxonomy capture on the web. ICCS:104–117 Galitsky B, Dobrocsi G, de la Rosa JL, Kuznetsov SO (2011) Using generalization of syntactic parse trees for taxonomy capture on the web. ICCS:104–117
go back to reference Ganter B, Kuznetsov S (2001) Pattern structures and their projections. In: Proc. 9th Int. Conf. on Conceptual Structures, ICCS’01, Stumme G, Delugach H (eds) Lecture Notes in Artificial Intelligence, vol. 2120, pp 129–142 Ganter B, Kuznetsov S (2001) Pattern structures and their projections. In: Proc. 9th Int. Conf. on Conceptual Structures, ICCS’01, Stumme G, Delugach H (eds) Lecture Notes in Artificial Intelligence, vol. 2120, pp 129–142
go back to reference Ganter B, Wille R (1999) Formal concept analysis. Springer, Mathematical FoundationsCrossRef Ganter B, Wille R (1999) Formal concept analysis. Springer, Mathematical FoundationsCrossRef
go back to reference Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco, CAMATH Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco, CAMATH
go back to reference Holder L, Cook D, Coble J, Mukherjee M (2005) Graph-based relational learning with application to security. Fundam Inf (Special Issue on Mining Graphs, Trees and Sequences) 1–2(6):83–101MathSciNetMATH Holder L, Cook D, Coble J, Mukherjee M (2005) Graph-based relational learning with application to security. Fundam Inf (Special Issue on Mining Graphs, Trees and Sequences) 1–2(6):83–101MathSciNetMATH
go back to reference Harsanyi JC, Selten R (1972) A generalized Nash solution fro two-person bargaining games with incomplete information. Manag Sci 1880–106 Harsanyi JC, Selten R (1972) A generalized Nash solution fro two-person bargaining games with incomplete information. Manag Sci 1880–106
go back to reference Jordan JS (1992) The exponential convergence of Bayesian learning in normal form games. Games Eco Beh 4202–217 Jordan JS (1992) The exponential convergence of Bayesian learning in normal form games. Games Eco Beh 4202–217
go back to reference Jayachandran S, Sharma S, Kaufman P, Raman P (2005, October) The role of relational information processes and technology use in customer relationship management. J Mark 69(4):177–192 Jayachandran S, Sharma S, Kaufman P, Raman P (2005, October) The role of relational information processes and technology use in customer relationship management. J Mark 69(4):177–192
go back to reference Kaburlasos VG, Ritter GX (2007) Computational intelligence based on lattice theory. Studies in CI N67 Kaburlasos VG, Ritter GX (2007) Computational intelligence based on lattice theory. Studies in CI N67
go back to reference Kolodner J (1993) Case-based reasoning. Morgan Kaufmann Kolodner J (1993) Case-based reasoning. Morgan Kaufmann
go back to reference Krogel MA., Rawles S, Zelezn F, Flach P, Lavrac N, Wrobel S (2003) Comparative evaluation on approaches to propositionalization. LNCS 2835 Springer, Berlin, pp. 142–155 Krogel MA., Rawles S, Zelezn F, Flach P, Lavrac N, Wrobel S (2003) Comparative evaluation on approaches to propositionalization. LNCS 2835 Springer, Berlin, pp. 142–155
go back to reference Kuznetsov SO (1999) Learning of simple conceptual graphs from positive and negative examples. In: Zytkow J, Rauch J (eds) Proc. Principles of Data Mining and Knowledge Discovery, Third European Conference, PKDD’99, Lecture Notes in Artificial Intelligence, vol. 1704, pp 384–392 Kuznetsov SO (1999) Learning of simple conceptual graphs from positive and negative examples. In: Zytkow J, Rauch J (eds) Proc. Principles of Data Mining and Knowledge Discovery, Third European Conference, PKDD’99, Lecture Notes in Artificial Intelligence, vol. 1704, pp 384–392
go back to reference Kuznetsov SO, Samokhin MV (2005) Learning closed sets of labeled graphs for chemical applications. ILP 2005:190–208MathSciNetMATH Kuznetsov SO, Samokhin MV (2005) Learning closed sets of labeled graphs for chemical applications. ILP 2005:190–208MathSciNetMATH
go back to reference Laza R, Corchado JM (2002) CBR-BDI agents in planning. Symposium on Informatics and Telecommunications (SIT’02). Sevilla, Spain, September 25–27, pp 181–192 Laza R, Corchado JM (2002) CBR-BDI agents in planning. Symposium on Informatics and Telecommunications (SIT’02). Sevilla, Spain, September 25–27, pp 181–192
go back to reference Liu B, Hu M, Cheng J (2005) Opinion observer: analyzing and comparing opinions on the Web. 14th WWW Conference, pp 342–351 Liu B, Hu M, Cheng J (2005) Opinion observer: analyzing and comparing opinions on the Web. 14th WWW Conference, pp 342–351
go back to reference Mill JS (1843) A system of logic, racionative and inductive. London Mill JS (1843) A system of logic, racionative and inductive. London
go back to reference Mitchell T (1997) Machine learning. McGraw-Hill Mitchell T (1997) Machine learning. McGraw-Hill
go back to reference Mitchell TM, Keller RM, Kedar-Cabelli ST (1986) Explanation-based generalization: a unifying view. Mach Learn 1:47–80 Mitchell TM, Keller RM, Kedar-Cabelli ST (1986) Explanation-based generalization: a unifying view. Mach Learn 1:47–80
go back to reference Mor Y, Goldman CV, Rosenschein JS (1995) Learn your opponent’s strategy (in polynomial time). In: Proceedings of IJCAI-95 Workshop on Adaptation and Learning in Multiagent Systems Mor Y, Goldman CV, Rosenschein JS (1995) Learn your opponent’s strategy (in polynomial time). In: Proceedings of IJCAI-95 Workshop on Adaptation and Learning in Multiagent Systems
go back to reference Muggleton S (1999) Inductive logic programming: issues, results and the challenge of learning language in logic artificial intelligence 114(1–2):283–296 Muggleton S (1999) Inductive logic programming: issues, results and the challenge of learning language in logic artificial intelligence 114(1–2):283–296
go back to reference Muller HJ, Dieng R (eds) (2000) Computational conflicts conflict modeling for distributed intelligent systems. Springer-Verlag, New York Muller HJ, Dieng R (eds) (2000) Computational conflicts conflict modeling for distributed intelligent systems. Springer-Verlag, New York
go back to reference Ngai EWT, Xiu L, Chau DCK (2009) Application of data mining techniques in customer relationship management. Expert Syst Appl 36:2592–2602CrossRef Ngai EWT, Xiu L, Chau DCK (2009) Application of data mining techniques in customer relationship management. Expert Syst Appl 36:2592–2602CrossRef
go back to reference Osborne MJ, Rubinstein A (1994) A course in game theory. The MIT Press Osborne MJ, Rubinstein A (1994) A course in game theory. The MIT Press
go back to reference Olivia C, Chang CF, Enguix CF, Ghose AK (1999) Case-based BDI agents an effective approach for intelligent search on the world wide web. In: Intelligent Agents in Cyberspace. AAAI Spring Symposium Olivia C, Chang CF, Enguix CF, Ghose AK (1999) Case-based BDI agents an effective approach for intelligent search on the world wide web. In: Intelligent Agents in Cyberspace. AAAI Spring Symposium
go back to reference Pang B, Lee L (2004) A sentimental education: sentiment analysis using subjectivity summarization based on minimum cuts. ACL Pang B, Lee L (2004) A sentimental education: sentiment analysis using subjectivity summarization based on minimum cuts. ACL
go back to reference Pang B, Lee L, Vaithyanathan S (2002) Thumbs up? sentiment classification using machine learning techniques. In: Proceedings of EMNLP Pang B, Lee L, Vaithyanathan S (2002) Thumbs up? sentiment classification using machine learning techniques. In: Proceedings of EMNLP
go back to reference Pang B, Lee L (2008, January) Opinion mining and sentiment analysis. Found Trends Inf Retr 2(1–2):1–135 Pang B, Lee L (2008, January) Opinion mining and sentiment analysis. Found Trends Inf Retr 2(1–2):1–135
go back to reference Plotkin GD (1970) A note on inductive generalization, Machine Intelligence, vol 5, Edinburgh University Press, pp 153–163 Plotkin GD (1970) A note on inductive generalization, Machine Intelligence, vol 5, Edinburgh University Press, pp 153–163
go back to reference Russell SJ (1986) Preliminary steps toward the automation of induction. In: Proceedings of the 5th National Conference on Artificial Intelligence. Morgan Kaufmann, Los Altos, CA, pp 477–484 Russell SJ (1986) Preliminary steps toward the automation of induction. In: Proceedings of the 5th National Conference on Artificial Intelligence. Morgan Kaufmann, Los Altos, CA, pp 477–484
go back to reference Rosenschein J, Zlotkin G (1994) Rules of encounter. MIT Press, Cambridge, MA Rosenschein J, Zlotkin G (1994) Rules of encounter. MIT Press, Cambridge, MA
go back to reference Riloff E (1996) Automatically generating extraction patterns from untagged text. In: Proceedings of the 13th National Conference on Artificial Intelligence (AAAI-96), pp 1044–1049 Riloff E (1996) Automatically generating extraction patterns from untagged text. In: Proceedings of the 13th National Conference on Artificial Intelligence (AAAI-96), pp 1044–1049
go back to reference Richardson M, Domingos P (2006) Markov logic networks. Mach Learn 62(1–2/February):107–136 Richardson M, Domingos P (2006) Markov logic networks. Mach Learn 62(1–2/February):107–136
go back to reference Searle J (1969) Speech acts. An essay in the philosophy of language. Eng.- Cambridge University Press, Cambridge Searle J (1969) Speech acts. An essay in the philosophy of language. Eng.- Cambridge University Press, Cambridge
go back to reference Sowa J (1984) Conceptual graphs, conceptual structures information processing in mind and machine. Addison-Wesley, Reading, MA Sowa J (1984) Conceptual graphs, conceptual structures information processing in mind and machine. Addison-Wesley, Reading, MA
go back to reference Stone P, Veloso M (2000) Multiagent systems a survey from a machine learning perspective. Autonomous Robotics 8(3):345–383CrossRef Stone P, Veloso M (2000) Multiagent systems a survey from a machine learning perspective. Autonomous Robotics 8(3):345–383CrossRef
go back to reference Swift R (2001) Accelerating customer relationships: using CRM and relationship technologies. Prentice Hall, London UK Swift R (2001) Accelerating customer relationships: using CRM and relationship technologies. Prentice Hall, London UK
go back to reference Turoff M, Hiltz SR, Bieber M, Fjermestad J, Rana A (1999) Collaborative discourse structures in computer mediated group communications. J Comput Med Commun 4(4) Turoff M, Hiltz SR, Bieber M, Fjermestad J, Rana A (1999) Collaborative discourse structures in computer mediated group communications. J Comput Med Commun 4(4)
go back to reference Turney PD (2002) Thumbs up or thumbs down? semantic orientation applied to unsupervised classification of reviews. 40th ACL, New Brunswick, NJ Turney PD (2002) Thumbs up or thumbs down? semantic orientation applied to unsupervised classification of reviews. 40th ACL, New Brunswick, NJ
go back to reference Vinogradov (1999) Logic programs for Quazi-axiomatic theories. Nauchno-Tehnicheskaya Informacia Ser 2 N2 61–64 [In Russian] Vinogradov (1999) Logic programs for Quazi-axiomatic theories. Nauchno-Tehnicheskaya Informacia Ser 2 N2 61–64 [In Russian]
go back to reference Weiss G, Sen S (1996) Adaptation and learning in multiagent systems. Lect Notes Art Int, vol. 1042. Springer-Verlag, Berlin Heidelberg New York Weiss G, Sen S (1996) Adaptation and learning in multiagent systems. Lect Notes Art Int, vol. 1042. Springer-Verlag, Berlin Heidelberg New York
go back to reference Wiebe J, Wilson T, Bell M (2001) Identifying collocations for recognizing opinions. In: Proceedings of ACL/EACL 2001 Workshop on Collocation, Toulouse, France Wiebe J, Wilson T, Bell M (2001) Identifying collocations for recognizing opinions. In: Proceedings of ACL/EACL 2001 Workshop on Collocation, Toulouse, France
go back to reference Yuan ST, WL Chang (2001, February) Mixed-initiative synthesized learning approach for web-based CRM. Exp Syst Appl 20(2):187–200(14) Yuan ST, WL Chang (2001, February) Mixed-initiative synthesized learning approach for web-based CRM. Exp Syst Appl 20(2):187–200(14)
go back to reference Yuksel A, Kilinc U, Yuksel F (2006) Cross-national analysis of hotel customers’ attitudes toward complaining and their complaining behaviours. Tour Manag 27(1):11–24CrossRef Yuksel A, Kilinc U, Yuksel F (2006) Cross-national analysis of hotel customers’ attitudes toward complaining and their complaining behaviours. Tour Manag 27(1):11–24CrossRef
go back to reference Yao YY (2004) Concept formation and learning: a cognitive informatics perspective. In: Proceedings of the Third IEEE International Conference on Cognitive Informatics (ICCI’04) Yao YY (2004) Concept formation and learning: a cognitive informatics perspective. In: Proceedings of the Third IEEE International Conference on Cognitive Informatics (ICCI’04)
go back to reference Zeng D, Sycara K (1997) Benefits of learning in negotiation. In: Proceedings of the 14th National Conference on Artificial Intelligence (AAAI-97). Menlo Park, CA AAAI Press, pp 36–42 Zeng D, Sycara K (1997) Benefits of learning in negotiation. In: Proceedings of the 14th National Conference on Artificial Intelligence (AAAI-97). Menlo Park, CA AAAI Press, pp 36–42
go back to reference Zirtiloǧlu H, Yolum P (2008) Ranking semantic information for e-government: complaints management. In: Proceedings of the first ACM international workshop on Ontology-supported business intelligence. Karlsruhe, Germany Zirtiloǧlu H, Yolum P (2008) Ranking semantic information for e-government: complaints management. In: Proceedings of the first ACM international workshop on Ontology-supported business intelligence. Karlsruhe, Germany
Metadata
Title
Concept-Based Learning of Complainants’ Behavior
Author
Boris Galitsky
Copyright Year
2021
DOI
https://doi.org/10.1007/978-3-030-61641-0_8