Université de Fribourg

Nodesketch: highly-efficient graph embeddings via recursive sketching

Yang, Dingqi ; Rosso, Paolo ; Li, Bin ; Cudre-Mauroux, Philippe

In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2019, p. 1162–1172

Embeddings have become a key paradigm to learn graph representations and facilitate downstream graph analysis tasks. Existing graph embedding techniques either sample a large number of node pairs from a graph to learn node embeddings via stochastic optimization, or factorize a high-order proximity/adjacency matrix of the graph via expensive matrix factorization. However, these techniques...

Université de Fribourg

D2 histosketch: discriminative and dynamic similarity-preserving sketching of streaming histograms

Yang, Dingqi ; Li, Bin ; Rettig, Laura ; Cudré-Mauroux, Philippe

In: IEEE Transactions on Knowledge and Data Engineering, 2018, p. 1–1

Histogram-based similarity has been widely adopted in many machine learning tasks. However, measuring histogram similarity is a challenging task for streaming histograms, where the elements of a histogram are observed one after the other in an online manner. The ever-growing cardinality of histogram elements over the data streams makes any similarity computation inefficient in that case. To...

Université de Fribourg

Histosketch: fast similarity-preserving sketching of streaming histograms with concept drift

Yang, Dingqi ; Li, Bin ; Rettig, Laura ; Cudre-Mauroux, Philippe

In: 2017 IEEE International Conference on Data Mining (ICDM), 2017, p. 545–554

Histogram-based similarity has been widely adopted in many machine learning tasks. However, measuring histogram similarity is a challenging task for streaming data, where the elements of a histogram are observed in a streaming manner. First, the ever-growing cardinality of histogram elements makes any similarity computation inefficient. Second, the concept-drift issue in the data streams also...

Université de Fribourg

POIsketch: Semantic Place Labeling over User Activity Streams

Yang, Dingqi ; Li, Bin ; Cudré-Mauroux, Philippe

In: Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI’16)

Université de Fribourg

A fast algorithm for predicting links to nodes of interest

Chen, Bolun ; Chen, Ling ; Li, Bin

In: Information Sciences, 2016, vol. 329, p. 552–567

The problem of link prediction has recently attracted considerable attention in various domains, such as sociology, anthropology, information science, and computer science. In many real world applications, we must predict similarity scores only between pairs of vertices in which users are interested, rather than predicting the scores of all pairs of vertices in the network. In this paper, we...