Feida Zhu

Feida Zhu

Auto-generated profile, based on publicly available information

Feida Zhu

School of Computing and Information Systems, Singapore Management University, Singapore, Singapore

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 April 2016 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
WXWei Xie
Wei Xie
FZFeida Zhu
Feida Zhu
JJJing Jiang
Jing Jiang
ELEe-Peng Lim
Ee-Peng Lim
KWKe Wang
Ke Wang
Twitter has become one of the largest microblogging platforms for users around the world to share anything happening around them with friends and beyond. A bursty topic in Twitter is one that triggers a surge of relevant tweets within a short period of time, which often reflects important events of mass interest. How to leverage Twitter for early detection of bursty topics has therefore become an important research problem with immense practical value. Despite the wealth of research work on topic modelling and analysis in Twitter, it remains a challenge to detect bursty topics in real-time. As existing methods can hardly scale to handle the task with the tweet stream in real-time, we propose in this paper $\sf {TopicSketch}$ , a sketch-based topic model together with a set of techniques to achieve real-time detection. We evaluate our solution on a tweet stream with over 30 million tweets. Our experiment results show both efficiency and effectiveness of our approach. Especially it is also demonstrated that $\sf {TopicSketch}$ on a single machine can potentially handle hundreds of millions tweets per day, which is on the same scale of the total number of daily tweets in Twitter, and present bursty events in finer-granularity.

18 June 2014
Verified
Conference Paper
Open access
SLSiyuan Liu
Siyuan Liu
SWShuhui Wang
Shuhui Wang
FZFeida Zhu
Feida Zhu
JZJinbo Zhang
Jinbo Zhang
RKRamayya Krishnan
Ramayya Krishnan
We study the problem of large-scale social identity linkage across different social media platforms, which is of critical importance to business intelligence by gaining from social data a deeper understanding and more accurate profiling of users. This paper proposes HYDRA, a solution framework which consists of three key steps: (I) modeling heterogeneous behavior by long-term behavior distribution analysis and multi-resolution temporal information matching; (II) constructing structural consistency graph to measure the high-order structure consistency on users' core social structures across different platforms; and (III) learning the mapping function by multi-objective optimization composed of both the supervised learning on pair-wise ID linkage information and the cross-platform structure consistency maximization. Extensive experiments on 10 million users across seven popular social network platforms demonstrate that HYDRA correctly identifies real user linkage across different platforms, and outperforms existing state-of-the-art algorithms by at least 20% under different settings, and 4 times better in most settings.

13 August 2016
Verified
Conference Paper
Open access
XMXin Mu
Xin Mu
FZFeida Zhu
Feida Zhu
ELEe-Peng Lim
Ee-Peng Lim
JXJing Xiao
Jing Xiao
JWJianzong Wang
Jianzong Wang
ZZZhi-Hua Zhou
Zhi-Hua Zhou
User identity linkage across social platforms is an important problem of great research challenge and practical value. In real applications, the task often assumes an extra degree of difficulty by requiring linkage across multiple platforms. While pair-wise user linkage between two platforms, which has been the focus of most existing solutions, provides reasonably convincing linkage, the result depends by nature on the order of platform pairs in execution with no theoretical guarantee on its stability. In this paper, we explore a new concept of ``Latent User Space'' to more naturally model the relationship between the underlying real users and their observed projections onto the varied social platforms, such that the more similar the real users, the closer their profiles in the latent user space. We propose two effective algorithms, a batch model(ULink) and an online model(ULink-On), based on latent user space modelling. Two simple yet effective optimization methods are used for optimizing objective function: the first one based on the constrained concave-convex procedure(CCCP) and the second on accelerated proximal gradient. To our best knowledge, this is the first work to propose a unified framework to address the following two important aspects of the multi-platform user identity linkage problem --- (I) the platform multiplicity and (II) online data generation. We present experimental evaluations on real-world data sets for not only traditional pairwise-platform linkage but also multi-platform linkage. The results demonstrate the superiority of our proposed method over the state-of-the-art ones.

27 October 2013
Verified
Conference Paper
Open access
PDF file
LYLiu Yang
Liu Yang
MQMinghui Qiu
Minghui Qiu
SGSwapna Gottipati
Swapna Gottipati
FZFeida Zhu
Feida Zhu
JJJing Jiang
Jing Jiang
ZCZhong Chen
Zhong Chen

11 May 2023 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
KRKunpeng Ren
Kunpeng Ren
NHNhut-Minh Ho
Nhut-Minh Ho
DLDumitrel Loghin
Dumitrel Loghin
TNThanh-Toan Nguyen
Thanh-Toan Nguyen
BOBeng Chin Ooi
Beng Chin Ooi
FZFeida Zhu
Feida Zhu
This paper presents a systematic and comprehensive survey on blockchain interoperability, where interoperability is defined as the ability of blockchains to flexibly transfer assets, share data, and invoke smart contracts across a mix of public, private, and consortium blockchains without any changes to the underlying blockchain systems. Analyzing the vast landscape of both research papers and industry projects, we classify the existing works into five categories, namely, (1) sidechains, (2) notary schemes, (3) hashed time lock contracts (HTLC), (4) relays, and (5) blockchain agnostic protocols. We analyze the existing works under a taxonomy that consists of system and safety characteristics, such as decentralization, direction of communication, locking mechanism, verification mechanism, trust, safety, liveness, and atomicity. Different from other surveys, we are the first to evaluate the performance of some representative interoperability approaches between Bitcoin and Ethereumcovering sidechains, notary schemes, and HTLCs. Even though the performance of cross-chain transactions is low (typically fewer than 10 transactions per second), the main reason is the underlying blockchain ( e.g. , Bitcoin and Ethereum) and not the interoperability approach. Finally, we discuss existing challenges and possible research directions inblockchain interoperability. For example, we identify challenges in interoperability acrosspermissioned and permissionless blockchains, in interacting with scripting blockchains, in security and privacy.

1 December 2008
Verified
Conference Paper
Closed access
CCChen Chen
Chen Chen
XYXifeng Yan
Xifeng Yan
FZFeida Zhu
Feida Zhu
JHJiawei Han
Jiawei Han
PYPhilip S. Yu
Philip S. Yu
OLAP (On-Line Analytical Processing) is an important notion in data analysis. Recently, more and more graph or networked data sources come into being. There exists a similar need to deploy graph analysis from different perspectives and with multiple granularities. However, traditional OLAP technology cannot handle such demands because it does not consider the links among individual data tuples. In this paper, we develop a novel graph OLAP framework, which presents a multi-dimensional and multi-level view over graphs. The contributions of this work are two-fold. First, starting from basic definitions, i.e., what are dimensions and measures in the graph OLAP scenario, we develop a conceptual framework for data cubes on graphs. We also look into different semantics of OLAP operations, and classify the framework into two major subcases: informational OLAP and topological OLAP. Then, with more emphasis on informational OLAP (topological OLAP will be covered in a future study due to the lack of space), we show how a graph cube can be materialized by calculating a special kind of measure called aggregated graph and how to implement it efficiently. This includes both full materialization and partial materialization where constraints are enforced to obtain an iceberg cube. We can see that the aggregated graphs, which depend on the graph properties of underlying networks, are much harder to compute than their traditional OLAP counterparts, due to the increased structural complexity of data. Empirical studies show insightful results on real datasets and demonstrate the efficiency of our proposed optimizations.