Kewen Liao

Kewen Liao

Auto-generated profile, based on publicly available information

Kewen Liao

School of Information Technology, Deakin University, Burwood, VIC, Australia

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

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

Representative Publications

View All Publications
10 January 2022 in Expert Systems with Applications
Verified
Journal Article
Closed access
Abdur Rahim Mohammad ForkanAbdur Rahim Mohammad Forkan
Abdur Rahim Mohammad Forkan
Yong-Bin KangYong-Bin Kang
Yong-Bin Kang
Prem Prakash JayaramanPrem Prakash Jayaraman
Prem Prakash Jayaraman
KLKewen Liao
Kewen Liao
RKRohit Kaul
Rohit Kaul
SSSamir Sinha
Samir Sinha

1 April 2019
Verified
Conference Paper
Closed access
LCLu Chen
Lu Chen
CLChengfei Liu
Chengfei Liu
KLKewen Liao
Kewen Liao
Jianxin LiJianxin Li
Jianxin Li
RZRui Zhou
Rui Zhou
Community search on attributed networks has recently attracted great deal of research interest. However, most of existing works require query users to specify some community structure parameters. This may not be always practical as sometimes a user does not have the knowledge and experience to decide the suitable parameters. In this paper, we propose a novel parameter-free contextual community model for attributed community search. The proposed model only requires a query context, i.e., a set of keywords describing the desired matching community context, while the community returned is both structure and attribute cohesive w.r.t. the provided query context. We theoretically show that both our exact and approximate contextual community search algorithms can be executed in worst case polynomial time. The exact algorithm is based on an elegant parametric maximum flow technique and the approximation algorithm that significantly improves the search efficiency is analyzed to have an approximation factor of 1/3. In the experiment, we use six real networks with ground-truth communities to evaluate the effectiveness of our contextual community model. Experimental results demonstrate that the proposed model can find near ground-truth communities. We also test both our exact and approximate algorithms using eight large real networks to demonstrate the high efficiency of the proposed algorithms.

1 October 2019 in Journal of Energy Engineering
Verified
Journal Article
Closed access
WLWeiling Li
Weiling Li
KLKewen Liao
Kewen Liao
QHQiang He
Qiang He
YXYunni Xia
Yunni Xia

22 February 2022 in IEEE Journal of Biomedical and Health Informatics
Verified
Journal Article
Closed access
ZLZhibin Liao
Zhibin Liao
KLKewen Liao
Kewen Liao
HSHaifeng Shen
Haifeng Shen
MBMarouska F. van Boxel
Marouska F. van Boxel
JPJasper Prijs
Jasper Prijs
JVJohan W. Verjans
Johan W. Verjans
Convolutional neural networks (CNNs) have gained significant popularity in orthopedic imaging in recent years due to their ability to solve fracture classification problems. A common criticism of CNNs is their opaque learning and reasoning process, making it difficult to trust machine diagnosis and the subsequent adoption of such algorithms in clinical setting. This is especially true when the CNN is trained with limited amount of medical data, which is a common issue as curating sufficiently large amount of annotated medical imaging data is a long and costly process. While interest has been devoted to explaining CNN learnt knowledge by visualizing network attention, the utilization of the visualized attention to improve network learning has been rarely investigated. This paper explores the effectiveness of regularizing CNN network with human-provided attention guidance on where in the image the network should look for answering clues. On two orthopedics radiographic fracture classification datasets, through extensive experiments we demonstrate that explicit human-guided attention indeed can direct correct network attention and consequently significantly improve classification performance. The development code for the proposed attention guidance is publicly available on https://github.com/zhibinliao89/fracture_attention_guidance .

21 October 2018
Verified
Book Chapter
Closed access
PDF file
Federico MontoriFederico Montori
Federico Montori
KLKewen Liao
Kewen Liao
Prem Prakash JayaramanPrem Prakash Jayaraman
Prem Prakash Jayaraman
LBLuciano Bononi
Luciano Bononi
TSTimos Sellis
Timos Sellis
Dimitrios GeorgakopoulosDimitrios Georgakopoulos
Dimitrios Georgakopoulos

11 April 2016
Verified
Conference Paper
Open access
PDF file
KLKewen Liao
Kewen Liao
MPMatthias Petri
Matthias Petri
AMAlistair Moffat
Alistair Moffat
AWAnthony Wirth
Anthony Wirth
Web crawls generate vast quantities of text, retained and archived by the search services that initiate them. To store such data and to allow storage costs to be minimized, while still providing some level of random access to the compressed data, efficient and effective compression techniques are critical. The Relative Lempel Ziv (RLZ) scheme provides fast decompression and retrieval of documents from within large compressed collections, and even with a relatively small RAM-resident dictionary, is competitive relative to adaptive compression schemes. To date, the dictionaries required by RLZ compression have been formed from concatenations of substrings regularly sampled from the underlying document collection, then pruned in a manner that seeks to retain only the high-use sections. In this work, we develop new dictionary design heuristics, based on effective construction, rather than on pruning; we identify dictionary construction as a (string) covering problem. To avoid the complications of string covering algorithms on large collections, we focus on k-mers and their frequencies. First, with a reservoir sampler, we efficiently identify the most common k-mers. Then, since a collection typically comprises regions of local similarity, we select in each \"epoch\" a segment whose k-mers together achieve, locally, the highest coverage score. The dictionary is formed from the concatenation of these epoch-derived segments. Our selection process is inspired by the greedy approach to the Set Cover problem. Compared with the best existing pruning method, CARE, our scheme has a similar construction time, but achieves better compression effectiveness. Over several multi-gigabyte document collections, there are relative gains of up to 27%.