Biblio
"Detection of Shape Anomalies: A Probabilistic Approach Using Hidden Markov Models", ICDE, pp. 1325-1327, 2008.
, "A data mining proxy approach for efficient frequent itemset mining", VLDB J., vol. 17, no. 4, pp. 947-970, 2008.
, "A data mining proxy approach for efficient frequent itemset mining", VLDB J., vol. 17, no. 4, pp. 947-970, 2008.
, "Fast computing reachability labelings for large graphs with high compression rate", EDBT, pp. 193-204, 2008.
, "Integrating Multiple Data Sources for Stock Prediction", WISE, pp. 77-89, 2008.
, "Mining Multiple Time Series Co-movements", APWeb, pp. 572-583, 2008.
, "Spotting Significant Changing Subgraphs in Evolving Graphs", ICDM, pp. 917-922, 2008.
, "Spotting Significant Changing Subgraphs in Evolving Graphs", ICDM, pp. 917-922, 2008.
, "Identifying bug signatures using discriminative graph mining", Proceedings of the eighteenth international symposium on Software testing and analysis, New York, NY, USA, ACM, pp. 141–152, 2009.
, "Discovering Burst Areas in Fast Evolving Graphs", DASFAA (1), pp. 171-185, 2010.
, "High efficiency and quality: large graphs matching", CIKM, pp. 1755-1764, 2011.
, "Link prediction: the power of maximal entropy random walk", CIKM, pp. 1147-1156, 2011.
, "Link prediction: the power of maximal entropy random walk", CIKM, pp. 1147-1156, 2011.
, "On Summarizing Graph Homogeneously", DASFAA Workshops, pp. 299-310, 2011.
, "Ranking Individuals and Groups by Influence Propagation", PAKDD (2), pp. 407-419, 2011.
, "Ranking Individuals and Groups by Influence Propagation", PAKDD (2), pp. 407-419, 2011.
, "Scalable Diversified Ranking on Large Graphs", ICDM, pp. 1152-1157, 2011.
, "Measuring robustness of complex networks under MVC attack", CIKM, pp. 1512-1516, 2012.
, "Robust Reputation-Based Ranking on Bipartite Rating Networks", SDM, pp. 612-623, 2012.
, "Co-occurrence prediction in a large location-based social network", Frontiers of Computer Science, vol. 7, no. 2, pp. 185-194, 2013.
, "Co-occurrence prediction in a large location-based social network", Frontiers of Computer Science, vol. 7, no. 2, pp. 185-194, 2013.
, "Efficiently computing k-edge connected components via graph decomposition", SIGMOD Conference: ACM, pp. 205-216, 2013.
, "Efficiently computing k-edge connected components via graph decomposition", SIGMOD Conference: ACM, pp. 205-216, 2013.
, "Efficiently computing k-edge connected components via graph decomposition", SIGMOD Conference: ACM, pp. 205-216, 2013.
, "Frequent Subgraph Summarization with Error Control", WAIM: Springer, pp. 1-12, 2013.
,