Biblio
Export 91 results:
Filters: First Letter Of Last Name is L [Clear All Filters]
"Adversarial Attack on Community Detection by Hiding Individuals", WWW, pp. 917-927, 2020.
, "A Balanced Ensemble Approach to Weighting Classifiers for Text Classification", ICDM, pp. 869-873, 2006.
, "Classifying High-Speed Text Streams", WAIM, pp. 148-160, 2003.
, "Classifying Text Streams in the Presence of Concept Drifts", PAKDD, pp. 373-383, 2004.
, "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.
, "Accelerating XML Structural Join by Partitioning", DEXA, pp. 280-289, 2005.
, "Accelerating XML Structural Join by Partitioning", DEXA, pp. 280-289, 2005.
, "Community search: a meta-learning approach", 2023 IEEE 39th International Conference on Data Engineering (ICDE): IEEE, pp. 2358–2371, 2023.
, "Data Mining Proxy: Serving Large Number of Users for Efficient Frequent Itemset Mining", PAKDD, pp. 458-463, 2004.
, "Data Mining Proxy: Serving Large Number of Users for Efficient Frequent Itemset Mining", PAKDD, pp. 458-463, 2004.
, "Data Mining Proxy: Serving Large Number of Users for Efficient Frequent Itemset Mining", PAKDD, pp. 458-463, 2004.
, "Detection of Shape Anomalies: A Probabilistic Approach Using Hidden Markov Models", ICDE, pp. 1325-1327, 2008.
, "Discovering Burst Areas in Fast Evolving Graphs", DASFAA (1), pp. 171-185, 2010.
, "Discriminative Category Matching: Efficient Text Classification for Huge Document Collections", ICDM, pp. 187-194, 2002.
, "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.
, "Dirichlet Graph Variational Autoencoder", NeurIPS, 2020.
, "Dirichlet Graph Variational Autoencoder", NeurIPS, 2020.
, "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.
, "Enumerating Maximum Cliques in Massive Graphs", IEEE Trans. Knowl. Data Eng., vol. 34, pp. 4215–4230, 2022.
, "Exploring Hierarchies in Online Social Networks", {IEEE} Trans. Knowl. Data Eng., vol. 28, pp. 2086–2100, 2016.
, "Exploring Hierarchies in Online Social Networks", {IEEE} Trans. Knowl. Data Eng., vol. 28, pp. 2086–2100, 2016.
,