Jinyan Li, Kelvin Sim, Guimei Liu, Limsoon Wong
The rigid all-versus-all adjacency required by a maximal biclique for its two vertex sets is extremely vulnerable to missing data. In the past, several types of quasi-bicliques have been proposed to...
Liu, G., and Chai, F. 2009. Seasonal and interannual variability of primary and export production in the South China Sea: a three-dimensional physical–biogeochemical model study. – ICES Journal...
Complex discovery from weighted PPI networks (2009)
Liu, Guimei, Wong, Limsoon, Chua, Hon Nian
Motivation: Protein complexes are important for understanding principles of cellular organization and function. High-throughput experimental techniques have produced a large amount of protein...
Jinyan Li, Guimei Liu, Haiquan Li, Limsoon Wong
Abstract — Maximal biclique (also known as complete bipartite) subgraphs can model many applications in web mining, business, and bioinformatics. Enumerating maximal biclique subgraphs from a graph...
A complete set of frequent itemsets can get undesirably large due to redundancy. Several representations have been proposed to eliminate the redundancy. Existing generator based representations rely...
A complete set of frequent itemsets can get undesirably large due to redundancy. Several representations have been proposed to eliminate the redundancy. Existing generator based representations rely...
A complete set of frequent itemsets can get undesirably large due to redundancy. Several representations have been proposed to eliminate the redundancy. Existing generator based representations rely...
Efficient Mining of Large Maximal Bicliques (2008)
Guimei Liu, Kelvin Sim, Jinyan Li
Abstract. Many real world applications rely on the discovery of maximal biclique subgraphs (complete bipartite subgraphs). However, existing algorithms for enumerating maximal bicliques are not very...
Distance Based Subspace Clustering with Flexible Dimension Partitioning (2008)
Traditional similarity or distance measurements usually become meaningless when the dimensions of the datasets increase, which has detrimental effects on clustering performance. In this paper, we...
Restoring Meaningful Episodes in a Proxy Log (2007)
Wenwu Lou, Hongjun Lu, Guimei Liu, Qiang Yang
Web logs collected at proxy servers, referred to as proxy logs, contain rich information about Web user activities. These logs are becoming critical data sources for various Web applications such as...
Supporting efficient and scalable frequent pattern mining (2005)
Thesis (Ph.D.)--Hong Kong University of Science and Technology, 2005
Supporting efficient and scalable frequent pattern mining / (2005)
Thesis (Ph.D.)--Hong Kong University of Science and Technology, 2005.
Supporting efficient and scalable frequent pattern mining / (2005)
Thesis (Ph.D.)--Hong Kong University of Science and Technology, 2005.
AFOPT: An Efficient Implementation of Pattern Growth Approach (2003)
Guimei Liu, Hongjun Lu, Jeffrey Xu Yu
In this paper, we revisit the frequent itemset mining (FIM) problem and focus on studying the pattern growth approach. Existing pattern growth algorithms differ in several dimensions: (1) item search...
Cut-and-pick transactions for proxy log mining (2002)
Wenwu Lou, Guimei Liu, Hongjun Lu, Qiang Yang
Abstract. Web logs collected by proxy servers, referred to as proxy logs or proxy traces, contain information about Web document accesses by many users against many Web sites.This “many-to-many ”...
Approximating fixed points of nonexpansive mappings (2000)
Guimei Liu, Deng Lei, Shenghong Li
We consider a mapping S of the form S=α0I+α1T1+α2T2+⋯+αkTk, where αi≥0, α0>0, α1>0 and ∑i=0kαi=1. We show...
Approximating fixed points of nonexpansive mappings (2000)
Guimei Liu, Deng Lei, Shenghong Li
We consider a mapping S of the form S=α0I+α1T1+α2T2+⋯+αkTk, where αi≥0, α0>0, α1>0 and ∑i=0kαi=1. We show that the Picard iterates of S converge to a common fixed point of...