Jey Han Lau

Jey Han Lau

Auto-generated profile, based on publicly available information

Jey Han Lau

The University of Melbourne

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
1 January 2014
Verified
Conference Paper
Closed access
JLJey Han Lau
Jey Han Lau
DNDavid Newman
David Newman
TBTimothy Baldwin
Timothy Baldwin

12 October 2016 in Cognitive Science
Verified
Journal Article
Closed access
PDF file
JLJey Han Lau
Jey Han Lau
ACAlexander Clark
Alexander Clark
SLShalom Lappin
Shalom Lappin

1 January 2019
Verified
Conference Paper
Open access
KZKaimin Zhou
Kaimin Zhou
CSChang Shu
Chang Shu
BLBinyang Li
Binyang Li
JLJey Han Lau
Jey Han Lau

3 April 2017
Verified
Conference Paper
Open access
PDF file
WZWei Emma Zhang
Wei Emma Zhang
QSQuan Z. Sheng
Quan Z. Sheng
JLJey Han Lau
Jey Han Lau
EAErmyas Abebe
Ermyas Abebe
Programming community-based question-answering (PCQA) websites such as Stack Overflow enable programmers to find working solutions to their questions. Despite detailed posting guidelines, duplicate questions that have been answered are frequently created. To tackle this problem, Stack Overflow provides a mechanism for reputable users to manually mark duplicate questions. This is a laborious effort, and leads to many duplicate questions remain undetected. Existing duplicate detection methodologies from traditional community based question-answering (CQA) websites are difficult to be adopted directly to PCQA, as PCQA posts often contain source code which is linguistically very different from natural languages. In this paper, we propose a methodology designed for the PCQA domain to detect duplicate questions. We model the detection as a classification problem over question pairs. To extract features for question pairs, our methodology leverages continuous word vectors from the deep learning literature, topic model features and phrases pairs that co-occur frequently in duplicate questions mined using machine translation systems. These features capture semantic similarities between questions and produce a strong performance for duplicate detection. Experiments on a range of real-world datasets demonstrate that our method works very well; in some cases over 30% improvement compared to state-of-the-art benchmarks. As a product of one of the proposed features, the association score feature, we have mined a set of associated phrases from duplicate questions on Stack Overflow and open the dataset to the public.

1 January 2018
Verified
Conference Paper
Open access
JLJey Han Lau
Jey Han Lau
TCTrevor Cohn
Trevor Cohn
TBTimothy Baldwin
Timothy Baldwin
JBJulian Brooke
Julian Brooke
AHAdam Hammond
Adam Hammond

11 July 2013 in ACM Transactions on Speech and Language Processing
Verified
Journal Article
Open access
JLJey Han Lau
Jey Han Lau
TBTimothy Baldwin
Timothy Baldwin
DNDavid Newman
David Newman
We investigate the impact of preextracting and tokenizing bigram collocations on topic models. Using extensive experiments on four different corpora, we show that incorporating bigram collocations in the document representation creates more parsimonious models and improves topic coherence. We point out some problems in interpreting test likelihood and test perplexity to compare model fit, and suggest an alternate measure that penalizes model complexity. We show how the Akaike information criterion is a more appropriate measure, which suggests that using a modest number (up to 1000) of top-ranked bigrams is the optimal topic modelling configuration. Using these 1000 bigrams also results in improved topic quality over unigram tokenization. Further increases in topic quality can be achieved by using up to 10,000 bigrams, but this is at the cost of a more complex model. We also show that multiword (bigram and longer) named entities give consistent results, indicating that they should be represented as single tokens. This is the first work to explicitly study the effect of n -gram tokenization on LDA topic models, and the first work to make empirical recommendations to topic modelling practitioners, challenging the standard practice of unigram-based tokenization.