A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf
.
Consistent bipartite graph co-partitioning for star-structured high-order heterogeneous data co-clustering
2005
Proceeding of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining - KDD '05
Heterogeneous data co-clustering has attracted more and more attention in recent years due to its high impact on various applications. While the co-clustering algorithms for two types of heterogeneous data (denoted by pair-wise co-clustering), such as documents and terms, have been well studied in the literature, the work on more types of heterogeneous data (denoted by high-order co-clustering) is still very limited. As an attempt in this direction, in this paper, we worked on a specific case
doi:10.1145/1081870.1081879
dblp:conf/kdd/GaoLZCM05
fatcat:qrwbxw7b7vaujfb7uk3tumwpwq