@inbook{hesse04formal,
  author = {Hesse, Wolfgang and Tilley, Thomas Alan},
  booktitle = {Formal Concept Analysis: Foundations and Applications},
  editor = {Ganter, Bernhard and Stumme, Gerd and Wille, Rudolf},
  interhash = {54a13f608055c749302314b5c092fcc0},
  intrahash = {e1574155f034b66e6193cda6088481ab},
  pages = {288-303},
  publisher = {Springer},
  series = {LNAI },
  title = {Formal Concept Analysis used for Software Analysis and Modelling},
  volume = 3626,
  year = 2005
}

@article{cimiano05learning,
  author = {Cimiano, Philipp and Hotho, Andreas and Staab, Steffen},
  date = {2007-07-26},
  ee = {http://www.jair.org/papers/paper1648.html},
  interhash = {4c09568cff62babd362aab03095f4589},
  intrahash = {eaaf0e4b3a8b29fab23b6c15ce2d308d},
  journal = {Journal on Artificial Intelligence Research},
  pages = {305-339},
  title = {Learning Concept Hierarchies from Text Corpora using Formal Concept Analysis},
  url = {http://dblp.uni-trier.de/db/journals/jair/jair24.html#CimianoHS05},
  volume = 24,
  year = 2005
}

@incollection{haridas2009exploring,
  abstract = {The outgrowth of social networks in the recent years has resulted in opportunities for interesting data mining problems, such as interest or friendship recommendations. A global ontology over the interests specified by the users of a social network is essential for accurate recommendations. We propose, evaluate and compare three approaches to engineering a hierarchical ontology over user interests. The proposed approaches make use of two popular knowledge bases, Wikipedia and Directory Mozilla, to extract interest definitions and/or relationships between interests. More precisely, the first approach uses Wikipedia to find interest definitions, the latent semantic analysis technique to measure the similarity between interests based on their definitions, and an agglomerative clustering algorithm to group similar interests into higher level concepts. The second approach uses the Wikipedia Category Graph to extract relationships between interests, while the third approach uses Directory Mozilla to extract relationships between interests. Our results show that the third approach, although the simplest, is the most effective for building a hierarchy over user interests.},
  address = {Berlin / Heidelberg},
  affiliation = {Kansas State University Nichols Hall Manhattan KS 66502},
  author = {Haridas, Mandar and Caragea, Doina},
  booktitle = {On the Move to Meaningful Internet Systems: OTM 2009},
  doi = {10.1007/978-3-642-05151-7_35},
  editor = {Meersman, Robert and Dillon, Tharam and Herrero, Pilar},
  file = {haridas2009exploring.pdf:haridas2009exploring.pdf:PDF},
  groups = {public},
  interhash = {2363d3cb1430a4b279692e1ff3413809},
  intrahash = {982538ff1fd44d2c3296b700eac859b3},
  pages = {1238-1245},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  timestamp = {2010-10-18 15:53:06},
  title = {Exploring Wikipedia and DMoz as Knowledge Bases for Engineering a User Interests Hierarchy for Social Network Applications},
  url = {http://dx.doi.org/10.1007/978-3-642-05151-7_35},
  username = {dbenz},
  volume = 5871,
  year = 2009
}

@inproceedings{shepitsen2008personalized,
  abstract = {Collaborative tagging applications allow Internet users to annotate resources with personalized tags. The complex network created by many annotations, often called a folksonomy, permits users the freedom to explore tags, resources or even other user's profiles unbound from a rigid predefined conceptual hierarchy. However, the freedom afforded users comes at a cost: an uncontrolled vocabulary can result in tag redundancy and ambiguity hindering navigation. Data mining techniques, such as clustering, provide a means to remedy these problems by identifying trends and reducing noise. Tag clusters can also be used as the basis for effective personalized recommendation assisting users in navigation. We present a personalization algorithm for recommendation in folksonomies which relies on hierarchical tag clusters. Our basic recommendation framework is independent of the clustering method, but we use a context-dependent variant of hierarchical agglomerative clustering which takes into account the user's current navigation context in cluster selection. We present extensive experimental results on two real world dataset. While the personalization algorithm is successful in both cases, our results suggest that folksonomies encompassing only one topic domain, rather than many topics, present an easier target for recommendation, perhaps because they are more focused and often less sparse. Furthermore, context dependent cluster selection, an integral step in our personalization algorithm, demonstrates more utility for recommendation in multi-topic folksonomies than in single-topic folksonomies. This observation suggests that topic selection is an important strategy for recommendation in multi-topic folksonomies.},
  address = {New York, NY, USA},
  author = {Shepitsen, Andriy and Gemmell, Jonathan and Mobasher, Bamshad and Burke, Robin},
  booktitle = {RecSys '08: Proceedings of the 2008 ACM conference on Recommender systems},
  doi = {http://doi.acm.org/10.1145/1454008.1454048},
  interhash = {c9028129dd7cd8314673bd64cbb6198e},
  intrahash = {a7552f8d8d5db4f867ae6e94e1a4442f},
  isbn = {978-1-60558-093-7},
  location = {Lausanne, Switzerland},
  pages = {259--266},
  publisher = {ACM},
  title = {Personalized recommendation in social tagging systems using hierarchical clustering},
  url = {http://portal.acm.org/citation.cfm?id=1454008.1454048},
  year = 2008
}

@article{cimiano05learning,
  author = {Cimiano, Philipp and Hotho, Andreas and Staab, Steffen},
  ee = {http://www.jair.org/papers/paper1648.html},
  interhash = {4c09568cff62babd362aab03095f4589},
  intrahash = {eaaf0e4b3a8b29fab23b6c15ce2d308d},
  journal = {Journal on Artificial Intelligence Research},
  pages = {305-339},
  title = {Learning Concept Hierarchies from Text Corpora using Formal Concept Analysis},
  url = {http://dblp.uni-trier.de/db/journals/jair/jair24.html#CimianoHS05},
  volume = 24,
  year = 2005
}