Skip to main content
Springer Nature Link
Log in

Parameter Tuning for Disjoint Clusters Based on Concept Lattices with Application to Location Learning

  • Conference paper
Rough Sets, Fuzzy Sets, Data Mining and Granular Computing (RSFDGrC 2007)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4482))

  • 1550 Accesses

Abstract

Clustering is a technique for grouping items in a dataset that are similar, while separating those items that are dissimilar. The use of concept lattices, from Formal Concept Analysis, for disjoint clustering is a recently studied problem. We develop an algorithm for disjoint clustering of transactional databases using concept lattices. Several heuristics are developed for tuning the support parameters used in this algorithm. Additionally, we discuss the application of this algorithm to Location Learning. In location learning, an object (for example an employee) to be tracked and localized carries an electronic tag, such as an RFID, capable of communicating with some access points that are in the range of the tag. Clustering can then be used to estimate the location of the tag given the signal strengths that can be heard.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations (Translator Franzke, C.). Springer, New York (1999)

    Book  MATH  Google Scholar 

  2. Saquer, J.M.: Using concept lattices for disjoint clustering. In: Proceedings of Information Knowledge and Sharing IKS, Scottsdale, AZ, USA (2003)

    Google Scholar 

  3. Burdick, D., Calimlim, M., Gehrke, J.: MAFIA: A maximal frequent itemset algorithm for transactional databases. In: Proceedings of the 17th International Conference on Data Engineering, pp. 443–452 (2001)

    Google Scholar 

  4. Fung, B.C.M., Wang, K., Ester, M.: Hierarchical document clustering using frequent itemsets. In: SDM (2003)

    Google Scholar 

  5. Beil, F., Ester, M., Xu, X.: Frequent term-based text clustering. In: KDD ’02: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, Edmonton, Alberta, Canada, pp. 436–442. ACM Press, New York (2002), doi:10.1145/775047.775110

    Chapter  Google Scholar 

  6. Carpineto, C., Romano, G.: GALOIS: An order-theoretic approach to conceptual clustering. In: ICML Proceedings of International Conference on Machine Learning, pp. 33–40 (1993)

    Google Scholar 

  7. Mineau, G.W., Godin, R.: Automatic structuring of knowledge bases by conceptual clustering. Knowledge and Data Engineering 7(5), 824–828 (1995), citeseer.ist.psu.edu/mineau95automatic.html

    Article  Google Scholar 

  8. Stumme, G., et al.: Computing iceberg concept lattices with TITANIC. Data Knowledge Engineering 42(2), 189–222 (2002), citeseer.ist.psu.edu/article/stumme02computing.html

    Article  MATH  Google Scholar 

  9. Newman, D., et al.: UCI repository of machine learning databases (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Nebraska - Lincoln, Lincoln, NE 68588-0115, USA

    Brandon M. Hauff & Jitender S. Deogun

Authors
  1. Brandon M. Hauff
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jitender S. Deogun
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Science and Engineering, York University, M3J 1P3, Toronto, Ontario, Canada

    Aijun An

  2. Institute of Computing Sciences, Poznań University of Technology, ul. Piotrowo 2, 60–965, Poznań, Poland

    Jerzy Stefanowski

  3. Department of Applied Computer Science, University of Winnipeg, R3B 2E9, Winnipeg, Manitoba, Canada

    Sheela Ramanna

  4. Department of Computer Science, University of Regina, S4S 0A2, Regina, Saskatchewan, Canada

    Cory J. Butz

  5. Department of Electrical and Computer Engineering, University of Alberta, T6G 2V4, Edmonton, Alberta, Canada

    Witold Pedrycz

  6. Institute of Compuer Science and Technology, Chongqing University of Posts and Telecommunications, 40065, Chongqing, P.R. China

    Guoyin Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hauff, B.M., Deogun, J.S. (2007). Parameter Tuning for Disjoint Clusters Based on Concept Lattices with Application to Location Learning. In: An, A., Stefanowski, J., Ramanna, S., Butz, C.J., Pedrycz, W., Wang, G. (eds) Rough Sets, Fuzzy Sets, Data Mining and Granular Computing. RSFDGrC 2007. Lecture Notes in Computer Science(), vol 4482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72530-5_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72530-5_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72529-9

  • Online ISBN: 978-3-540-72530-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics