Hanghang Tong

Hanghang Tong is a person.

• See: Association Rule Mining.

---

---

References

• Personal Homepage: http://www.cs.cmu.edu/~htong/
• Google Scholar Author Page: http://scholar.google.com/citations?user=RaINcuUAAAAJ

2014

• (Ni et al., 2014) ⇒ Jingchao Ni, Hanghang Tong, Wei Fan, and Xiang Zhang. (2014). “Inside the Atoms: Ranking on a Network of Networks.” In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ISBN:978-1-4503-2956-9 doi:10.1145/2623330.2623643

2010

• (Henderson et al., 2010) ⇒ Keith Henderson, Tina Eliassi-Rad, Christos Faloutsos, Leman Akoglu, Lei Li, Koji Maruhashi, B. Aditya Prakash, and Hanghang Tong. (2010). “Metric Forensics: A Multi-level Approach for Mining Volatile Graphs.” In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2010). doi:10.1145/1835804.1835828

2008

• (Tong et al., 2008) ⇒ Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, Philip S. Yu, and Christos Faloutsos. (2008). “Colibri: Fast Mining of Large Static and Dynamic Graphs.” In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2008). doi:10.1145/1401890.1401973
• (Gallagher et al., 2008) ⇒ Brian Gallagher, Hanghang Tong, Tina Eliassi-Rad, and Christos Faloutsos. (2008). “Using Ghost Edges for Classification in Sparsely Labeled Networks.” In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2008). doi:10.1145/1401890.1401925

2007

• (Tong & al 2007) ⇒ Hanghang Tong, Christos Faloutsos, Brian Gallagher, and Tina Eliassi-Rad. “Fast best-effort pattern matching in large attributed graphs.” In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 737-746. ACM, 2007.

---