@article{han2000mining,
  acmid = {335372},
  address = {New York, NY, USA},
  author = {Han, Jiawei and Pei, Jian and Yin, Yiwen},
  doi = {10.1145/335191.335372},
  interhash = {e4fe828e65efd092193dcf9195df8074},
  intrahash = {209f4e054d61d0aeac09d1d43aa7f561},
  issn = {0163-5808},
  issue_date = {June 2000},
  journal = {SIGMOD Rec.},
  month = may,
  number = 2,
  numpages = {12},
  pages = {1--12},
  publisher = {ACM},
  title = {Mining Frequent Patterns Without Candidate Generation},
  url = {http://doi.acm.org/10.1145/335191.335372},
  volume = 29,
  year = 2000
}

@book{Han:2011:DMC:1972541,
  address = {San Francisco, CA, USA},
  author = {Han, Jiawei and Kamber, Micheline and Pei, Jian},
  edition = {3rd},
  interhash = {8a1fe4e4b855565639bab355e2c57ff1},
  intrahash = {edc1a7cbc3a6c3e5544a5a53af44c1ae},
  isbn = {0123814790, 9780123814791},
  publisher = {Morgan Kaufmann Publishers Inc.},
  title = {Data Mining: Concepts and Techniques},
  year = 2011
}

@electronic{han2012mining,
  address = {Waltham, Mass.},
  author = {Han, Jiawei and Kamber, Micheline and Pei, Jian},
  interhash = {247a70f1f22ce1914e46d7ff6f43e378},
  intrahash = {beb274b9aeaebb87f5423781b6839f54},
  isbn = {0123814790},
  publisher = {Morgan Kaufmann Publishers},
  refid = {818321921},
  title = {Data mining concepts and techniques, third edition},
  url = {http://www.amazon.de/Data-Mining-Concepts-Techniques-Management/dp/0123814790/ref=tmm_hrd_title_0?ie=UTF8&qid=1366039033&sr=1-1},
  year = 2012
}

@book{han2011mining,
  address = {Amsterdam [u.a.]},
  author = {Han, Jiawei and Kamber, Micheline},
  interhash = {c94d7099d50ba439ee4579de99af285c},
  intrahash = {1cf9e5362e9f34194abad46a4ff9c771},
  isbn = {9780123814791 0123814790},
  publisher = {Elsevier/Morgan Kaufmann},
  refid = {734060711},
  title = {Data mining : concepts and techniques},
  url = {http://www.amazon.de/Data-Mining-Practical-Techniques-Management/dp/0123748569/ref=sr_1_2?ie=UTF8&qid=1366038862&sr=8-2&keywords=Data+mining},
  year = 2011
}

@inproceedings{zhu2008graph,
  author = {Zhu, Feida and Chen, Chen and Yan, Xifeng and Han, Jiawei and Yu, Philip S},
  booktitle = {Proc. 2008 Int. Conf. on Data Mining (ICDM'08), Pisa, Italy, Dec. 2008.},
  interhash = {b9f7956dd1e140a386376df25f1a4117},
  intrahash = {066f245bd365c69acfff1378d72dc01e},
  month = {December},
  title = {{Graph OLAP: Towards Online Analytical Processing on Graphs}},
  year = 2008
}

@inproceedings{han02mining,
  author = {Han, Jiawei and Wang, Jianyong and Lu, Ying and Tzvetkov, Petre},
  bibsource = {DBLP, http://dblp.uni-trier.de},
  booktitle = {Proceedings of the 2002 IEEE International Conference on Data Mining
    (ICDM 2002)},
  crossref = {DBLP:conf/icdm/2002},
  ee = {http://computer.org/proceedings/icdm/1754/17540211abs.htm},
  interhash = {6a3d8b5724c4cc71792ea39715273a14},
  intrahash = {4d11a48363c6ec806d630ae6bee9f9a4},
  pages = {211-218},
  publisher = {IEEE Computer Society},
  title = {Mining Top-K Frequent Closed Patterns without Minimum Support},
  year = 2002
}

@inproceedings{wang03closet+,
  address = {New York, NY, USA},
  author = {Wang, Jianyong and Han, Jiawei and Pei, Jian},
  booktitle = {KDD '03: Proceedings of the ninth ACM SIGKDD international conference
    on Knowledge discovery and data mining},
  doi = {http://doi.acm.org/10.1145/956750.956779},
  interhash = {1ab296cc6f95fdd8a98f1af950017198},
  intrahash = {85f380be0590b17e5b88e93e0439033e},
  isbn = {1-58113-737-0},
  location = {Washington, D.C.},
  pages = {236--245},
  publisher = {ACM Press},
  title = {CLOSET+: searching for the best strategies for mining frequent closed
    itemsets},
  year = 2003
}

@inproceedings{conf/pkdd/CaiSHYH05,
  author = {Cai, Deng and Shao, Zheng and He, Xiaofei and Yan, Xifeng and Han, Jiawei},
  booktitle = {PKDD},
  crossref = {conf/pkdd/2005},
  date = {2005-11-14},
  editor = {Jorge, Alípio and Torgo, Luís and Brazdil, Pavel and Camacho, Rui and Gama, João},
  ee = {http://dx.doi.org/10.1007/11564126_44},
  interhash = {ffbc54eea27012bcd133f5b96fde010f},
  intrahash = {6045c9e8efdcbe1578f1f769c6b9274b},
  isbn = {3-540-29244-6},
  pages = {445-452},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {Community Mining from Multi-relational Networks.},
  url = {http://dblp.uni-trier.de/db/conf/pkdd/pkdd2005.html#CaiSHYH05},
  volume = 3721,
  year = 2005
}

@inproceedings{conf/sigmod/NgLHP98,
  author = {Ng, Raymond T. and Lakshmanan, Laks V. S. and Han, Jiawei and Pang, Alex},
  booktitle = {SIGMOD Conference},
  cdrom = {SIGMOD98/P013.PDF},
  cite = {conf/sigmod/AgrawalIS93},
  ee = {db/conf/sigmod/NgLHP98.html},
  interhash = {c4e73bae8e22a39d15d022631c69ddbf},
  intrahash = {72825e6a12b3285349fb64c1020383c0},
  pages = {13-24},
  title = {Exploratory Mining and Pruning Optimizations of Constrained Association Rules.},
  url = {http://dblp.uni-trier.de/db/conf/sigmod/sigmod98.html#NgLHP98},
  year = 1998
}

@inproceedings{1014146,
  abstract = { Many real-world graphs have been shown to be scale-free---vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is small. We present a new model for understanding scale-free networks based on multilevel geodesic approximation, using a new data structure called a multilevel mesh.Using this multilevel framework, we propose a new kind of graph clustering for data reduction of very large graph systems such as social, biological, or electronic networks. Finally, we apply our algorithms to real-world social networks and protein interaction graphs to show that they can reveal knowledge embedded in underlying graph structures. We also demonstrate how our data structures can be used to quickly answer approximate distance and shortest path queries on scale-free networks.
},
  address = {New York, NY, USA},
  author = {Wu, Andrew Y. and Garland, Michael and Han, Jiawei},
  booktitle = {KDD '04: Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining},
  interhash = {e387dfe40f301d698bf03f338a9cda02},
  intrahash = {ace73eceff27aaba6e70b390c2f3000f},
  isbn = {1-58113-888-1},
  pages = {719--724},
  publisher = {ACM Press},
  title = {Mining scale-free networks using geodesic clustering},
  url = {http://doi.acm.org/10.1145/1014052.1014146},
  year = 2004
}

@inproceedings{conf/icdt/KungNLH01,
  author = {Tung, Anthony K. H. and Ng, Raymond T. and Lakshmanan, Laks V. S. and Han, Jiawei},
  booktitle = {ICDT},
  cite = {conf/sigmod/AgrawalGGR98},
  ee = {db/conf/icdt/KungNLH01.html},
  interhash = {2cdcd4e5dabb22957312cf313e751af8},
  intrahash = {6d9c0bd59b8bc5964d6b28b09623967e},
  pages = {405-419},
  title = {Constraint-based clustering in large databases.},
  url = {http://dblp.uni-trier.de/db/conf/icdt/icdt2001.html#KungNLH01},
  year = 2001
}