@inproceedings{xin2008www,
        title = {Tag-based Social Interest Discovery},
        author = {Xin Li and Lei Guo and Yihong E. Zhao},
        booktitle = {Proceedings of the 17th International World Wide Web Conference},
        pages = {675-684},
        publisher = {ACM},
        year = 2008,
        url = {http://www2008.org/papers/pdf/p675-liA.pdf},
        abstract = {The success and popularity of social network systems, such as del.icio.us, Facebook, MySpace, and YouTube, have generated many interesting and challenging problems to the research community. Among others, discovering social interests shared by groups of users is very important because it helps to connect people with common interests and encourages people to contribute and share more contents. The main challenge to solving this problem comes from the diffi- culty of detecting and representing the interest of the users. The existing approaches are all based on the online connections of users and so unable to identify the common interest of users who have no online connections. In this paper, we propose a novel social interest discovery approach based on user-generated tags. Our approach is motivated by the key observation that in a social network, human users tend to use descriptive tags to annotate the contents that they are interested in. Our analysis on a large amount of real-world traces reveals that in general, user-generated tags are consistent with the web content they are attached to, while more concise and closer to the understanding and judgments of human users about the content. Thus, patterns of frequent co-occurrences of user tags can be used to characterize and capture topics of user interests. We have developed an Internet Social Interest Discovery system, ISID, to discover the common user interests and cluster users and their saved URLs by different interest topics. Our evaluation shows that ISID can effectively cluster similar documents by interest topics and discover user communities with common interests no matter if they have any online connections.},
	biburl = {http://www.bibsonomy.org/bibtex/242b4c94cff05ccef031235d661a7a77a/hotho},
	keywords = {*** association clustering community del.icio.us detection folksonomy rules}
}

@inproceedings{schmitz2006mining,
        title = {Mining Association Rules in Folksonomies},
        address = {Ljubljana},
        author = {Christoph Schmitz and Andreas Hotho and Robert Jäschke and Gerd Stumme},
        booktitle = {Data Science and Classification (Proc. IFCS 2006 Conference)},
        editor = {V. Batagelj and H.-H. Bock and A. Ferligoj and A. Žiberna},
        month = {July},
        pages = {261-270},
        publisher = {Springer},
        series = {Studies in Classification, Data Analysis, and Knowledge Organization},
        year = 2006,
        url = {http://www.kde.cs.uni-kassel.de/hotho/pub/2006/schmitz2006asso_ifcs.pdf},
        isbn = {978-3-540-34415-5},
	vgwort = {18},
	doi = {10.1007/3-540-34416-0_28},
	biburl = {http://www.bibsonomy.org/bibtex/2c8dbb6371be8d67e3aa1928bd3dd0fed/hotho},
	keywords = {2006 analysis association folksonomy kdubiq myown network rules semantic seminar2006 sosbuch summerschool}
}

@article{flajolet85probabilistic,
        title = {Probabilistic Counting Algorithms for Data Base Applications},
        author = {Philippe Flajolet and G. Nigel Martin},
        journal = {Journal of Computer and System Sciences},
        number = 2,
        pages = {182-209},
        volume = 31,
        year = 1985,
        url = {http://citeseer.ist.psu.edu/flajolet85probabilistic.html},
        description = {Probabilistic Counting Algorithms for Data Base Applications - Flajolet, Martin (ResearchIndex)},
	biburl = {http://www.bibsonomy.org/bibtex/27ccb5baa7d4e0836127b21468c92a27d/hotho},
	keywords = {association counting dm kdubiq rule toread}
}

@inproceedings{conf/sigmod/NgLHP98,
        title = {Exploratory Mining and Pruning Optimizations of Constrained Association Rules.},
        author = {Raymond T. Ng and Laks V. S. Lakshmanan and Jiawei Han and Alex Pang},
        booktitle = {SIGMOD Conference},
        pages = {13-24},
        year = 1998,
        url = {http://dblp.uni-trier.de/db/conf/sigmod/sigmod98.html#NgLHP98},
        cite = {conf/sigmod/AgrawalIS93},
	ee = {db/conf/sigmod/NgLHP98.html},
	cdrom = {SIGMOD98/P013.PDF},
	description = {dblp},
	biburl = {http://www.bibsonomy.org/bibtex/272825e6a12b3285349fb64c1020383c0/hotho},
	keywords = {2006 lecture rules association constraints kdd mining}
}

@inproceedings{672836,
        title = {Fast Algorithms for Mining Association Rules in Large Databases},
        address = {San Francisco, CA, USA},
        author = {Rakesh Agrawal and Ramakrishnan Srikant},
        booktitle = {VLDB '94: Proceedings of the 20th International Conference on Very Large Data Bases},
        pages = {487--499},
        publisher = {Morgan Kaufmann Publishers Inc.},
        year = 1994,
        isbn = {1-55860-153-8},
	biburl = {http://www.bibsonomy.org/bibtex/2cce11d670329a38a90f625b8005dfb8d/hotho},
	keywords = {2006 lecture rule association kdd mining}
}

@article{park1995ehb,
        title = {{An effective hash-based algorithm for mining association rules}},
        author = {J.S. Park and M.S. Chen and P.S. Yu},
        journal = {Proceedings of the 1995 ACM SIGMOD international conference on Management of data},
        pages = {175-186},
        publisher = {ACM Press New York, NY, USA},
        year = 1995,
        biburl = {http://www.bibsonomy.org/bibtex/2094af08c931c876e20fd0e1e5086583b/hotho},
	keywords = {2006 table lecture rules association kdd mining hash}
}

@inproceedings{conf/kdd/LiuHM98,
        title = {Integrating Classification and Association Rule Mining.},
        author = {Bing Liu and Wynne Hsu and Yiming Ma},
        booktitle = {KDD},
        pages = {80-86},
        year = 1998,
        url = {http://www.comp.nus.edu.sg/~dm2/publications/kdd98_1.ps},
        ee = {http://portal.acm.org/citation.cfm?id=502512.502560},
	biburl = {http://www.bibsonomy.org/bibtex/276bb213b1e4c8b14fe7e4f4d2569a4af/hotho},
	keywords = {rule combination classification association mining}
}

@inproceedings{SrikantAgrawal95,
        title = {Mining Generalized Association Rules},
        author = {R. Srikant and R. Agrawal},
        booktitle = {Proceedings of the 21st International Conference on Very Large Databases},
        month = {Sep},
        pages = {407--419},
        year = 1995,
        location = {Zurich, Switzerland},
	biburl = {http://www.bibsonomy.org/bibtex/28c68af52691fe5b3f4db26dea63c8a31/hotho},
	keywords = {generalized rules association mining}
}