@article{Nutanong:2011:IHD:2002974.2002978,
  abstract = {The Hausdorff distance is commonly used as a similarity measure between two point sets. Using this measure, a set X is considered similar to Y iff every point in X is close to at least one point in Y. Formally, the Hausdorff distance HausDist(X, Y) can be computed as the Max-Min distance from X to Y, i.e., find the maximum of the distance from an element in X to its nearest neighbor (NN) in Y. Although this is similar to the closest pair and farthest pair problems, computing the Hausdorff distance is a more challenging problem since its Max-Min nature involves both maximization and minimization rather than just one or the other. A traditional approach to computing HausDist(X, Y) performs a linear scan over X and utilizes an index to help compute the NN in Y for each x in X. We present a pair of basic solutions that avoid scanning X by applying the concept of aggregate NN search to searching for the element in X that yields the Hausdorff distance. In addition, we propose a novel method which incrementally explores the indexes of the two sets X and Y simultaneously. As an example application of our techniques, we use the Hausdorff distance as a measure of similarity between two trajectories (represented as point sets). We also use this example application to compare the performance of our proposed method with the traditional approach and the basic solutions. Experimental results show that our proposed method outperforms all competitors by one order of magnitude in terms of the tree traversal cost and total response time.},
  acmid = {2002978},
  author = {Nutanong, Sarana and Jacox, Edwin H. and Samet, Hanan},
  doi = {10.14778/2002974.2002978},
  interhash = {431cfc6757195ff943dc064d42e3dc57},
  intrahash = {065b9da64ffb2abff443d8d9ff24abb2},
  issn = {2150-8097},
  issue_date = {May 2011},
  journal = {Proc. VLDB Endow.},
  month = may,
  number = 8,
  numpages = {12},
  pages = {506--517},
  publisher = {VLDB Endowment},
  title = {An Incremental Hausdorff Distance Calculation Algorithm},
  url = {http://dx.doi.org/10.14778/2002974.2002978},
  volume = 4,
  year = 2011
}

@inproceedings{becker00conceptual,
  address = {Heidelberg},
  author = {Becker, K. and Stumme, G. and Wille, R. and Wille, U. and Zickwolff, M.},
  booktitle = {Knowledge Engineering and Knowledge Management. Methods, Models, and Tools.},
  comment = {alpha},
  editor = {Dieng, R. and Corby, O.},
  interhash = {dacb08013d9496d41d4f9f39bce7ecd1},
  intrahash = {8533101d55261b955b9ca6bca2cb73fc},
  pages = {352-365},
  publisher = {Springer},
  series = {LNAI},
  title = {Conceptual Information Systems Discussed Through an {IT}-Security Tool},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2000/EKAW00.pdf},
  volume = 1937,
  year = 2000
}

@article{jaeschke08discovering,
  author = {Jäschke, Robert and Hotho, Andreas and Schmitz, Christoph and Ganter, Bernhard and Stumme, Gerd},
  interhash = {cfca594f9dbe30694bfbcdeb40dc4e88},
  intrahash = {eb0bdaeab0aa5d4c528c97e2b10770b9},
  journal = {Journal of Web Semantics},
  number = 1,
  pages = {38-53},
  title = {Discovering Shared Conceptualizations in Folksonomies},
  url = {http://dx.doi.org/10.1016/j.websem.2007.11.004},
  volume = 6,
  year = 2008
}

@inproceedings{stumme05finite,
  address = {Heidelberg},
  author = {Stumme, Gerd},
  bibsource = {DBLP, http://dblp.uni-trier.de},
  booktitle = {Proc. 3rd Intl. Conf. on Formal Concept Analysis},
  editor = {Ganter, Bernhard and Godin, Robert},
  ee = {http://springerlink.metapress.com/openurl.asp?genre=article{\&}issn=0302-9743{\&}volume=3403{\&}spage=315},
  interhash = {7d85e1092613fd7c91d6ba5dfcf4a044},
  intrahash = {1671b75099da5291bf20aefe0d22f3b4},
  isbn = {3-540-24525-1},
  pages = {315-328},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {A Finite State Model for On-Line Analytical Processing in
               Triadic Contexts},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2005/stumme2005finite.pdf},
  volume = 3403,
  year = 2005
}

@inproceedings{stumme05finite,
  author = {Stumme, Gerd},
  booktitle = {Proc. 3rd Intl. Conf. on Formal Concept Analysis},
  editor = {Ganter, Bernhard and Godin, Robert},
  ee = {http://springerlink.metapress.com/openurl.asp?genre=article{\&}issn=0302-9743{\&}volume=3403{\&}spage=315},
  interhash = {7d85e1092613fd7c91d6ba5dfcf4a044},
  intrahash = {468f01390bf3c74843de096a5d79b293},
  isbn = {3-540-24525-1},
  pages = {315-328},
  publisher = {Springer},
  series = {LNCS},
  title = {A Finite State Model for On-Line Analytical Processing in Triadic
    Contexts.},
  volume = 3403,
  year = 2005
}

@inproceedings{jaeschke06trias,
  address = {Hong Kong},
  author = {Jäschke, Robert and Hotho, Andreas and Schmitz, Christoph and Ganter, Bernhard and Stumme, Gerd},
  booktitle = {Proceedings of the 6th IEEE International Conference on Data Mining     (ICDM 06)},
  doi = {http://doi.ieeecomputersociety.org/10.1109/ICDM.2006.162},
  interhash = {b4964c3bdd2991a80873d7080ef6a73e},
  intrahash = {e387c294129e11f4221514d5fa807e26},
  isbn = {0-7695-2701-9},
  issn = {1550-4786},
  month = {December},
  pages = {907-911},
  publisher = {IEEE Computer Society},
  title = {TRIAS - An Algorithm for Mining Iceberg Tri-Lattices},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2006/jaeschke2006trias.pdf},
  vgwort = {19},
  year = 2006
}

@incollection{ksog94tripat,
  address = {Berlin},
  author = {Krolak-Schwerdt, S. and Orlik, P. and Ganter, B.},
  booktitle = {Studies in Classification, Data Analysis, and Knowledge Organization},
  editor = {Bock, H. H. and Lenski, W. and Richter, M. M.},
  interhash = {7fd4d379f0b2f082f7f32444de4c56a6},
  intrahash = {2eaf7d1c43191097d5356753acfa1da2},
  pages = {298--307},
  publisher = {Springer},
  series = {Information systems and data analysis },
  title = {{TRIPAT}: a model for analyzing three-mode binary data},
  volume = 4,
  year = 1994
}

@inproceedings{hotho2006trend,
  abstract = {As the number of resources on the web exceeds by far the number of
documents one can track, it becomes increasingly difficult to remain
up to date on ones own areas of interest. The problem becomes more
severe with the increasing fraction of multimedia data, from which
it is difficult to extract some conceptual description of their
contents.

One way to overcome this problem are social bookmark tools, which
are rapidly emerging on the web. In such systems, users are setting
up lightweight conceptual structures called folksonomies, and
overcome thus the knowledge acquisition bottleneck. As more and more
people participate in the effort, the use of a common vocabulary
becomes more and more stable. We present an approach for discovering
topic-specific trends within folksonomies. It is based on a
differential adaptation of the PageRank algorithm to the triadic
hypergraph structure of a folksonomy. The approach allows for any
kind of data, as it does not rely on the internal structure of the
documents. In particular, this allows to consider different data
types in the same analysis step. We run experiments on a large-scale
real-world snapshot of a social bookmarking system.},
  address = {Heidelberg},
  author = {Hotho, Andreas and Jäschke, Robert and Schmitz, Christoph and Stumme, Gerd},
  booktitle = {Proc. First International Conference on Semantics And Digital Media Technology (SAMT) },
  date = {2006-12-13},
  editor = {Avrithis, Yannis S. and Kompatsiaris, Yiannis and Staab, Steffen and O'Connor, Noel E.},
  ee = {http://dx.doi.org/10.1007/11930334_5},
  interhash = {227be738c5cea57530d592463fd09abd},
  intrahash = {42cda5911e901eadd0ac6a106a6aa1dc},
  isbn = {3-540-49335-2},
  month = dec,
  pages = {56-70},
  publisher = {Springer},
  series = {LNCS},
  title = {Trend Detection in Folksonomies},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2006/hotho2006trend.pdf},
  vgwort = {27},
  volume = 4306,
  year = 2006
}

@inproceedings{BiedermannWille96,
  address = {Heidelberg},
  author = {Biedermann, Klaus and Wille, Rudolf},
  booktitle = {From data to knowledge},
  editor = {Gaul, W. and Pfeiffer, D.},
  interhash = {240cd62a73343c8257ab2a4d3d9d6052},
  intrahash = {671bac5e68875a410e5b157315a9986f},
  pages = {141-150},
  publisher = {Springer--Verlag},
  title = {Valuations and hierarchizations},
  year = 1996
}

@inproceedings{LehmannWille95,
  address = {Berlin--Heidelberg--New~York},
  author = {Lehmann, Fritz and Wille, Rudolf},
  booktitle = {Conceptual structures: applications, implementation and theory},
  editor = {Ellis, G. and Levinson, R. and Rich, W. and Sowa, J. F.},
  interhash = {fa3e423ee0c5a9dadc3211c3f8a5e4a6},
  intrahash = {341d19e74e2cce2ea9d5a94df8b48873},
  number = 954,
  pages = {32-43},
  publisher = {Springer--Verlag},
  series = {Lecture Notes in Artificial Intelligence},
  title = {A triadic approach to formal concept analysis},
  year = 1995
}