The Chinese University of Hong Kong

About: The Chinese University of Hong Kong is a education organization based out in Hong Kong, China. It is known for research contribution in the topics: Population & Cancer. The organization has 43411 authors who have published 93672 publications receiving 3066651 citations.

Entropy-based subspace clustering for mining numerical data

Abstract: Mining numerical data is a relatively difficult problem in data mining. Clustering is one of the techniques. We consider a database with numerical attributes, in which each transaction is viewed as a multi-dimensional vector. By studying the clusters formed by these vectors, we can discover certain behaviors hidden in the data. Traditional clustering algorithms find clusters in the full space of the data sets. This results in high dimensional clusters, which are poorly comprehensible to human. One important task in this setting is the ability to discover clusters embedded in the subspaces of a high-dimensional data set. This problem is known as subspace clustering. We follow the basic assumptions of previous work CLIQUE. It is found that the number of subspaces with clustering is very large, and a criterion called the coverage is proposed in CLIQUE for the pruning. In addition to coverage, we identify new useful criteria for this problem and propose an entropybased algorithm called ENCLUS to handle the criteria. Our major contributions are: (1) identify new meaningful criteria of high density and correlation of dimensions for goodness of clustering in subspaces, (2) introduce the use of entropy and provide evidence to support its use, (3) make use of two closure properties based on entropy to prune away uninteresting subspaces efficiently, (4) propose a mechanism to mine non-minimally correlated subspaces which are of interest because of strong clustering, (5) experiments are carried out to show the effectiveness of the proposed method.

Channel Estimation for Intelligent Reflecting Surface Assisted Multiuser Communications: Framework, Algorithms, and Analysis

Abstract: In intelligent reflecting surface (IRS) assisted communication systems, the acquisition of channel state information is a crucial impediment for achieving the beamforming gain of IRS because of the considerable overhead required for channel estimation Specifically, under the current beamforming design for IRS-assisted communications, in total $KMN+KM$ channel coefficients should be estimated, where $K$ , $N$ and $M$ denote the numbers of users, IRS reflecting elements, and antennas at the base station (BS), respectively For the first time in the literature, this paper points out that despite the vast number of channel coefficients that should be estimated, significant redundancy exists in the user-IRS-BS reflected channels of different users arising from the fact that each IRS element reflects the signals from all the users to the BS via the same channel To utilize this redundancy for reducing the channel estimation time, we propose a novel three-phase pilot-based channel estimation framework for IRS-assisted uplink multiuser communications, in which the user-BS direct channels and the user-IRS-BS reflected channels of a typical user are estimated in Phase I and Phase II, respectively, while the user-IRS-BS reflected channels of the other users are estimated with low overhead in Phase III via leveraging their strong correlation with those of the typical user Under this framework, we analytically prove that a time duration consisting of $K+N+\max (K-1,\lceil (K-1)N/M \rceil)$ pilot symbols is sufficient for perfectly recovering all the $KMN+KM$ channel coefficients under the case without receiver noise at the BS Further, under the case with receiver noise, the user pilot sequences, IRS reflecting coefficients, and BS linear minimum mean-squared error channel estimators are characterized in closed-form