@inproceedings{conf/icdm/TangWL09,
  author = {Tang, Lei and Wang, Xufei and Liu, Huan},
  booktitle = {ICDM},
  crossref = {conf/icdm/2009},
  date = {2010-01-27},
  editor = {Wang, Wei and Kargupta, Hillol and Ranka, Sanjay and Yu, Philip S. and Wu, Xindong},
  ee = {http://doi.ieeecomputersociety.org/10.1109/ICDM.2009.20},
  interhash = {e689d9e29e78d2c869896121ad37a772},
  intrahash = {e54ea4c1636d8589d7a7d119291cb1ea},
  isbn = {978-0-7695-3895-2},
  pages = {503-512},
  publisher = {IEEE Computer Society},
  title = {Uncoverning Groups via Heterogeneous Interaction Analysis.},
  url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.150.7384&rep=rep1&type=pdf},
  year = 2009
}

@inproceedings{conf/sigir/HuFCZLYC08,
  author = {Hu, Jian and Fang, Lujun and Cao, Yang and Zeng, Hua-Jun and Li, Hua and Yang, Qiang and Chen, Zheng},
  booktitle = {SIGIR},
  crossref = {conf/sigir/2008},
  date = {2008-07-27},
  editor = {Myaeng, Sung-Hyon and Oard, Douglas W. and Sebastiani, Fabrizio and Chua, Tat-Seng and Leong, Mun-Kew},
  ee = {http://doi.acm.org/10.1145/1390334.1390367},
  interhash = {0a2878165034dcdfacb9045608ec482a},
  intrahash = {76f863a12c0b983ec67682deaec1ada4},
  isbn = {978-1-60558-164-4},
  pages = {179-186},
  publisher = {ACM},
  title = {Enhancing text clustering by leveraging Wikipedia semantics.},
  url = {http://dblp.uni-trier.de/db/conf/sigir/sigir2008.html#HuFCZLYC08},
  year = 2008
}

@inproceedings{conf/pakdd/HuangMFW09,
  author = {Huang, Anna and Milne, David N. and Frank, Eibe and Witten, Ian H.},
  booktitle = {PAKDD},
  crossref = {conf/pakdd/2009},
  date = {2009-04-25},
  editor = {Theeramunkong, Thanaruk and Kijsirikul, Boonserm and Cercone, Nick and Ho, Tu Bao},
  ee = {http://dx.doi.org/10.1007/978-3-642-01307-2_62},
  interhash = {b2ea40479e6537693a659a4342892fee},
  intrahash = {63d65d3bd978e39f33f39222be9a3f76},
  isbn = {978-3-642-01306-5},
  pages = {628-636},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {Clustering Documents Using a Wikipedia-Based Concept Representation.},
  url = {http://dblp.uni-trier.de/db/conf/pakdd/pakdd2009.html#HuangMFW09},
  volume = 5476,
  year = 2009
}

@article{jrg1998densitybased,
  abstract = {The clustering algorithm DBSCAN relies on a density-based notion of clusters and is designed to discover clusters of arbitrary shape as well as to distinguish noise. In this paper, we generalize this algorithm in two important directions. The generalized algorithm—called GDBSCAN—can cluster point objects as well as spatially extended objects according to both, their spatial and their nonspatial attributes. In addition, four applications using 2D points (astronomy), 3D points (biology), 5D points (earth science) and 2D polygons (geography) are presented, demonstrating the applicability of GDBSCAN to real-world problems.
ER  -},
  author = {Sander, Jörg and Ester, Martin and Kriegel, Hans-Peter and Xu, Xiaowei},
  interhash = {3f2615cbf7c60d63f0a1ccc82e0caea1},
  intrahash = {a15f4445f49f37f272b373c69231a590},
  journal = {Data Mining and Knowledge Discovery},
  month = {#jun#},
  number = 2,
  pages = {169--194},
  title = {Density-Based Clustering in Spatial Databases: The Algorithm GDBSCAN and Its Applications},
  url = {http://dx.doi.org/10.1023/A:1009745219419},
  volume = 2,
  year = 1998
}

@inproceedings{Detecting_Commmunities_via_Simultaneous_Clustering_of_Graphs_and_Folksonomies,
  author = {Java, Akshay and Joshi, Anupam and Finin, Tim},
  booktitle = {WebKDD 2008 Workshop on Web Mining and Web Usage Analysis},
  interhash = {acfec953843b168e61e2e167e29b4c3d},
  intrahash = {645abd6b3191a2a6e844d7542651ed1c},
  month = {August},
  note = {To Appear},
  title = {Detecting Commmunities via Simultaneous Clustering of Graphs and Folksonomies},
  year = 2008
}

@inproceedings{conf/kdd/ChiSZHT07,
  author = {Chi, Yun and Song, Xiaodan and Zhou, Dengyong and Hino, Koji and Tseng, Belle L.},
  booktitle = {KDD},
  crossref = {conf/kdd/2007},
  date = {2007-08-23},
  editor = {Berkhin, Pavel and Caruana, Rich and Wu, Xindong},
  ee = {http://doi.acm.org/10.1145/1281192.1281212},
  interhash = {542ce3968b0d75048000f35669a7fb83},
  intrahash = {0829ef077986e88540a96bd8ba154d86},
  isbn = {978-1-59593-609-7},
  pages = {153-162},
  publisher = {ACM},
  title = {Evolutionary spectral clustering by incorporating temporal smoothness.},
  url = {http://dblp.uni-trier.de/db/conf/kdd/kdd2007.html#ChiSZHT07},
  year = 2007
}

@inproceedings{conf/icml/WagstaffCRS01,
  author = {Wagstaff, Kiri and Cardie, Claire and Rogers, Seth and Schrödl, Stefan},
  booktitle = {ICML},
  crossref = {conf/icml/2001},
  date = {2002-11-27},
  editor = {Brodley, Carla E. and Danyluk, Andrea Pohoreckyj},
  interhash = {10d8a7c9e5b5f9cf0d0848cf8c10f604},
  intrahash = {c0c3565625192ee6748b52d9d4f3b526},
  isbn = {1-55860-778-1},
  pages = {577-584},
  publisher = {Morgan Kaufmann},
  title = {Constrained K-means Clustering with Background Knowledge.},
  url = {http://dblp.uni-trier.de/db/conf/icml/icml2001.html#WagstaffCRS01},
  year = 2001
}

@inproceedings{conf/cvpr/ShiM97,
  author = {Shi, Jianbo and Malik, Jitendra},
  booktitle = {CVPR},
  ee = {http://computer.org/proceedings/cvpr/7822/78220731abs.htm},
  interhash = {600345c3af56da066873a30c9971a615},
  intrahash = {bc4607ac2084911e4b1ba23b323f649a},
  pages = {731-737},
  title = {Normalized Cuts and Image Segmentation.},
  url = {http://dblp.uni-trier.de/db/conf/cvpr/cvpr1997.html#ShiM97},
  year = 1997
}

@inproceedings{grahl07conceptualKdml,
  author = {Grahl, Miranda and Hotho, Andreas and Stumme, Gerd},
  booktitle = {Workshop Proceedings of Lernen - Wissensentdeckung - Adaptivität (LWA 2007)},
  editor = {Hinneburg, Alexander},
  interhash = {9c3bb05456bf11bcd88a1135de51f7d9},
  intrahash = {6d5188d66564fe4ed7386e28868504de},
  isbn = {978-3-86010-907-6},
  month = sep,
  pages = {50-54},
  publisher = {Martin-Luther-Universität Halle-Wittenberg},
  title = {Conceptual Clustering of Social Bookmark Sites},
  url = {http://www.tagora-project.eu/wp-content/2007/06/grahl_iknow07.pdf },
  vgwort = {14},
  year = 2007
}

@inproceedings{Begelman2006,
  address = {Edinburgh},
  author = {Begelman, Grigory and Keller, Philipp and Smadja, Frank},
  booktitle = {Proceedings of the WWW 2006 Workshop on Collaborative Web Tagging 	Workshop},
  interhash = {ffacd9d40f6cba1aa8140f501c2a1802},
  intrahash = {95449b3d4b12e8930d529e1e22d51e04},
  month = may,
  pdf = {http://www.rawsugar.com/www2006/20.pdf},
  timestamp = {2007.04.11},
  title = {Automated Tag Clustering: Improving search and exploration in the tag space},
  url = {http://www.rawsugar.com/www2006/taggingworkshopschedule.html},
  year = 2006
}

@inproceedings{mcqueen1967smc,
  author = {MacQueen, J.},
  booktitle = {Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability - Vol. 1},
  editor = {{Le Cam}, L. M. and Neyman, J.},
  interhash = {8d7d4dfe7d3a06b8c9c3c2bb7aa91e28},
  intrahash = {d23dfdff44ca5121fde221604128ab80},
  pages = {281--297},
  publisher = {University of California Press, Berkeley, CA, USA},
  title = {Some Methods for Classification and Analysis of Multivariate Observations},
  url = {http://projecteuclid.org/euclid.bsmsp/1200512992},
  year = 1967
}

@article{cattuto2007,
  author = {Cattuto, C. and Schmitz, C. and Baldassarri, A. and Servedio, V. D. P. and Loreto, V. and Hotho, A. and Grahl, M. and Stumme, G.},
  interhash = {fc5f2df61d28bc99b7e15029da125588},
  intrahash = {d87e198a6d564ae8a8fe151e0a96fa0f},
  journal = {AI Communications},
  number = 4,
  pages = {245 - 262},
  title = {Network Properties of Folksonomies},
  url = {http://www.kde.cs.uni-kassel.de/hotho/pub/2007/aicomm_2007_folksonomy_clustering.pdf},
  vgwort = {67},
  volume = 20,
  year = 2007
}

@article{partitioning89,
  author = {Pothen, A. and Simon, H.D. and Liou, K.P.},
  interhash = {2f6596b5093c7d16e3817dadf39b8aa2},
  intrahash = {7444914fc73fc8ec12a67e5e172c34c0},
  journal = {SIAM J. MATRIX ANAL. APPLIC.},
  number = 3,
  pages = {430--452},
  title = {{Partitioning Sparse Matrices with Eigenvectors of Graphs}},
  url = {http://ntrs.nasa.gov/archive/nasa/casi.ntrs.nasa.gov/19970011963_1997016998.pdf },
  volume = 11,
  year = 1990
}

@unpublished{ranade:sus,
  author = {Ranade, A.G.},
  interhash = {473e92f688426631dd9ccc7639a5e861},
  intrahash = {9f7f1562631792a85f2dd5f5eefbcf4d},
  title = {{Some uses of spectral methods}},
  year = 2000
}

@techreport{Spielman:1996,
  address = {Berkeley, CA, USA},
  author = {Spielman, Daniel A. and Teng, Shang},
  interhash = {83f3d15605beda920551830ccac3d79a},
  intrahash = {06b1b19e0a29a145555cb1526716c451},
  publisher = {University of California at Berkeley},
  title = {Spectral Partitioning Works: Planar Graphs and Finite Element Meshes},
  year = 1996
}

@article{donath1973lbp,
  author = {Donath, W.E. and Hoffman, A.J.},
  interhash = {ff38bdeb46caa114a3efad739319973f},
  intrahash = {7cb789bd22dfa8ccdd2abdd30121dfc9},
  journal = {IBM Journal of Research and Development},
  number = 5,
  pages = {420--425},
  title = {{Lower bounds for the partitioning of graphs}},
  volume = 17,
  year = 1973
}

@inproceedings{Ng01onspectral,
  abstract = {Despite many empirical successes of spectral clustering methods| algorithms that cluster points using eigenvectors of matrices derived from the data|there are several unresolved issues. First, there are a wide variety of algorithms that use the eigenvectors in slightly dierent ways. Second, many of these algorithms have no proof that they will actually compute a reasonable clustering. In this paper, we present a simple spectral clustering algorithm that can be implemented using a few lines of Matlab. Using tools from matrix perturbation theory, we analyze the algorithm, and give conditions under which it can be expected to do well. We also show surprisingly good experimental results on a number of challenging clustering problems. 1},
  author = {Ng, Andrew Y. and Jordan, Michael I. and Weiss, Yair},
  booktitle = {Advances in Neural Information Processing Systems 14},
  interhash = {b72c97e659127fc653a0d51143d85b0c},
  intrahash = {7485849e42418ee5ceefb45dc6eb603c},
  pages = {849--856},
  publisher = {MIT Press},
  title = {On spectral clustering: Analysis and an algorithm},
  year = 2001
}

@article{keyhere,
  abstract = {Established in 2005, YouTube is one of the fastest-growing websites, and has become one of the most accessed sites in the
Internet. It has a significant impact on the Internet traffic distribution, but itself is suffering from severe scalabilityconstraints. Understanding the features of YouTube and similar video sharing sites is thus crucial to network traffic engineeringand to sustainable development of this new generation of services.},
  author = {Cheng, Xu and Dale, Cameron and Liu, Jiangchuan},
  interhash = {472b1063972e934e1f9ab675b5896a77},
  intrahash = {46d32b77eec4c8ffa4c8f469131a95b1},
  journal = {Peer-to-Peer Video},
  pages = {205--217},
  title = {Characteristics and Potentials of YouTube: A Measurement Study},
  url = {http://dx.doi.org/10.1007/978-0-387-76450-4_9},
  year = 2008
}

@article{gross:ira,
  author = {Gross, R. and Acquisti, A.},
  interhash = {19bb9c028aa5074819b2e2ab1aa90824},
  intrahash = {967d9adc2e573348524ac6dbe09b42fe},
  title = {{Information revelation and privacy in online social networks}},
  year = 2008
}

@inproceedings{1435498,
  address = {New York, NY, USA},
  author = {Maia, Marcelo and Almeida, Jussara and Almeida, Virg\'{\i}lio},
  booktitle = {SocialNets '08: Proceedings of the 1st workshop on Social network systems},
  doi = {http://doi.acm.org/10.1145/1435497.1435498},
  interhash = {c8510afc8df91d8a87bfff0fdacc5cab},
  intrahash = {21aa1a6e2e63cb7c23a29130e69b74af},
  isbn = {978-1-60558-124-8},
  location = {Glasgow, Scotland},
  pages = {1--6},
  publisher = {ACM},
  title = {Identifying user behavior in online social networks},
  url = {http://portal.acm.org/citation.cfm?id=1435497.1435498},
  year = 2008
}