Search Results for author: Meng-Chieh Lee

Found 7 papers, 6 papers with code

End-To-End Self-tuning Self-supervised Time Series Anomaly Detection

no code implementations3 Apr 2024 Boje Deforce, Meng-Chieh Lee, Bart Baesens, Estefanía Serral Asensio, Jaemin Yoo, Leman Akoglu

A two-fold challenge for TSAD is a versatile and unsupervised model that can detect various different types of time series anomalies (spikes, discontinuities, trend shifts, etc.)

Anomaly Detection Data Augmentation +2

NetInfoF Framework: Measuring and Exploiting Network Usable Information

1 code implementation12 Feb 2024 Meng-Chieh Lee, Haiyang Yu, Jian Zhang, Vassilis N. Ioannidis, Xiang Song, Soji Adeshina, Da Zheng, Christos Faloutsos

Given a node-attributed graph, and a graph task (link prediction or node classification), can we tell if a graph neural network (GNN) will perform well?

Link Prediction Node Classification

Descriptive Kernel Convolution Network with Improved Random Walk Kernel

1 code implementation8 Feb 2024 Meng-Chieh Lee, Lingxiao Zhao, Leman Akoglu

In this paper, we first revisit the RWK and its current usage in KCNs, revealing several shortcomings of the existing designs, and propose an improved graph kernel RWK+, by introducing color-matching random walks and deriving its efficient computation.

Descriptive Feature Engineering +1

NetEffect: Discovery and Exploitation of Generalized Network Effects

1 code implementation31 Dec 2022 Meng-Chieh Lee, Shubhranshu Shekhar, Jaemin Yoo, Christos Faloutsos

Given a large graph with few node labels, how can we (a) identify whether there is generalized network-effects (GNE) or not, (b) estimate GNE to explain the interrelations among node classes, and (c) exploit GNE efficiently to improve the performance on downstream tasks?

Graph Mining Node Classification

Less is More: SlimG for Accurate, Robust, and Interpretable Graph Mining

1 code implementation8 Oct 2022 Jaemin Yoo, Meng-Chieh Lee, Shubhranshu Shekhar, Christos Faloutsos

Graph neural networks (GNNs) have succeeded in many graph mining tasks, but their generalizability to various graph scenarios is limited due to the difficulty of training, hyperparameter tuning, and the selection of a model itself.

Graph Mining Node Classification

gen2Out: Detecting and Ranking Generalized Anomalies

1 code implementation6 Sep 2021 Meng-Chieh Lee, Shubhranshu Shekhar, Christos Faloutsos, T. Noah Hutson, Leon Iasemidis

Our main contribution is the gen2Out algorithm, that has the following desirable properties: (a) Principled and Sound anomaly scoring that obeys the axioms for detectors, (b) Doubly-general in that it detects, as well as ranks generalized anomaly -- both point- and group-anomalies, (c) Scalable, it is fast and scalable, linear on input size.

Anomaly Detection EEG

AutoAudit: Mining Accounting and Time-Evolving Graphs

1 code implementation1 Nov 2020 Meng-Chieh Lee, Yue Zhao, Aluna Wang, Pierre Jinghong Liang, Leman Akoglu, Vincent S. Tseng, Christos Faloutsos

How can we spot money laundering in large-scale graph-like accounting datasets?

Social and Information Networks

Cannot find the paper you are looking for? You can Submit a new open access paper.