On Linguistic Approaches in Flexible Querying and Mining of Association Rules

  • Janusz Kacprzyk
  • Sławomir Zadrożny
Part of the Advances in Soft Computing book series (AINSC, volume 7)


A combination of flexible querying and data mining is discussed. The framework considered is a classical relational database management querying interface. The flexible querying is here accomplished through a direct use of linguistic, imprecise terms in queries. A popular data mining technique of the association rules is employed to provide for an even more sophisticated querying environment. Some of its extensions are discussed and illustrated.


Association Rule Linguistic Term Association Rule Mining Database Management System Artificial Attribute 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Agrawal R. and R. Srikant: Fast algorithms for mining association rules. In: Proceedings of the 20th International Conference on Very Large Databases, Santiago, Chile, 1994.Google Scholar
  2. [2]
    Anwar T.M., Beck H.W. and S.B. Navathe: Knowledge mining by imprecise querying: A classification based system. In: Proceedings of the International Conference on Data Engineering, Tampa, USA, 1992, 622630.Google Scholar
  3. [3]
    Azmy A.: SuperQuery: Data Minig for Everyone. http://www.azmy.comGoogle Scholar
  4. [4]
    Boulicaut J.-F., Bykowski A. and B. Jeudy: Towards the Tractable Discovery of Association Rules with Negations. In this volume.Google Scholar
  5. [5]
    Delgado M., Sanchez D., Martin-Bautista M.J. and M.A. Vila: Mining strong approximate dependencies from relational databases. In: Proceedings of the Eight International Conference on Information Processing and Management of Uncertainty in Knowledge-based Systems (IPMU’2000), Madrid, Spain, 2000, 1123–1130.Google Scholar
  6. [6]
    George R. and R. Srikanth• Data summarization using genetic algorithms and fuzzy logic. In: Genetic Algorithms and Soft Computing (F. Herrera and J.L. Verdegay), Physica-Verlag, Heidelberg and New York, 1996, 599–611.Google Scholar
  7. [7]
    Kacprzyk J. and P. Strykowski: Linguistic data summaries for intelligent decision support. In: Fuzzy Decision Analysis and Recognition Technology for Management, Planning and Optimization–Proceedings of EFDAN’99 (R. Felix ), Germany, 1999, 3–12.Google Scholar
  8. [8]
    Kacprzyk J. and P. Strykowski: Linguitic Summaries of Sales Data at a Computer Retailer: A Case Study. Proceedings of IFSA’99 (Taipei, Taiwan R.O.C), vol. 1, 1999, 29–33.Google Scholar
  9. [9]
    Kacprzyk J. and S. Zadrozny: FQUERY for Access: fuzzy querying for a Windows-based DBMS. In: Fuzziness in Database Management Systems (P. Bose and J. Kacprzyk), Physica-Verlag, Heidelberg, 1995, 415–433.Google Scholar
  10. [10]
    Kacprzyk J. and S. Zadrozny: Flexible querying using fuzzy logic: An implementation for Microsoft Access. In: Flexible Query Answering Systems (T. Andreasen, H. Christiansen and H.L. Larsen), Kluwer, Boston, 1997, 247–275.CrossRefGoogle Scholar
  11. [11]
    Kacprzyk J. and S. Zadrozny: Data mining via linguistic summaries of data: An interactive approach. In: Methodologies for the Conception, Design and Application of Soft Computing (T. Yamakawa and G. Matsumoto), Proceedings of IIZUKA’98, Iizuka, Japan, 1998, 668–671.Google Scholar
  12. [12]
    Kacprzyk J. and S. Zadrozny: On sumarization of large datasets via a fuzzy-logic-based querying add-on to Microsoft Access. In: Intelligent Information Systems VII, Malbork, Poland, IPI PAN, Warsaw, 1998, 249–258.Google Scholar
  13. [13]
    Kuncheva I.L.: Fuzzy Classifier Design. Physica-Verlag, Heidelberg, New York, 2000.Google Scholar
  14. [14]
    Lee J.-H. and Lee-Kwang H.: An extension of association rules using fuzzy sets. In: Proceedings of the Seventh IFSA World Congress, 1997, Prague, Czech Republic. Vol. 1, 399–402.Google Scholar
  15. [15]
    Liu B., Hsu W. and M. Yiming: Integrating Classification and Association Rule Mining. In: Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining (KDD-98, Plenary Presentation), New York, USA, 1998.Google Scholar
  16. [16]
    Mannila H., Toivonen H. and A.I. Verkamo: Efficient algorithms for discovering association rules. In: Proceedings of the AAAI Workshop on Knowledge Discovery in Databases (U.M. Fayyad and R. Uthurusamy), Seattle, USA, 1994, 181–192.Google Scholar
  17. [17]
    Srikant R. and R. Agrawal: Mining generalized association rules. In: Proceedings of the 21st International Conference on Very Large Databases, Zurich, Switzerland, 1995.Google Scholar
  18. [18]
    Srikant R. and R. Agrawal: Mining quantitative association rules in large relational tables. In: Proceedings of the ACM-SIGMOD 1996 Conference on Management of Data, Montreal, Canada, 1996.Google Scholar
  19. [19]
    Srikant R., Vu Q. and R. Agrawal: Mining association rules with item constraints. In: Proceedings of the 3rd International Conference on Knowledge Discovery in Databases and Data Mining, Newport Beach, USA, 1997.Google Scholar
  20. [20]
    Yager R.R.: On linguistic summaries of data. In: Knowledge Discovery in Databases (G. Piatetsky-Shapiro and W.J. Frawley), AAAI Press/The MIT Press, Menlo Park, 1991, 347–363.Google Scholar
  21. [21]
    Zadeh L.A.: A computational approach to fuzzy quantifiers in natural languages. Computers and Maths. with Appls. 9 (1983), 149–184.MathSciNetMATHGoogle Scholar
  22. [22]
    Zadeh L.A.:A computational theory of dispositions. International Journal of Intelligent Systems 2 (1987), 39–64.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Janusz Kacprzyk
    • 1
  • Sławomir Zadrożny
    • 1
  1. 1.Polish Academy of Sciences ul. Newelska 6Systems Research InstituteWarsawPoland

Personalised recommendations