Остановите войну!
for scientists:
default search action
Xiaofeng He
- > Home > Persons > Xiaofeng He
Publications
- 2006
- [j3]Chris H. Q. Ding, Xiaofeng He, Hui Xiong, Hanchuan Peng, Stephen R. Holbrook:
Transitive closure and metric inequality of weighted graphs: detecting protein interaction modules using cliques. Int. J. Data Min. Bioinform. 1(2): 162-177 (2006) - [c24]Chris H. Q. Ding, Ding Zhou, Xiaofeng He, Hongyuan Zha:
R1-PCA: rotational invariant L1-norm principal component analysis for robust subspace factorization. ICML 2006: 281-288 - 2005
- [c23]Chris H. Q. Ding, Xiaofeng He, Horst D. Simon:
Nonnegative Lagrangian Relaxation of K-Means and Spectral Clustering. ECML 2005: 530-538 - [c22]Chris H. Q. Ding, Xiaofeng He, Hanchuan Peng:
Finding cliques in protein interaction networks via transitive closure of a weighted graph. BIOKDD 2005: 69-75 - [c21]Chris H. Q. Ding, Xiaofeng He:
Cluster Aggregate Inequality and Multi-level Hierarchical Clustering. PKDD 2005: 71-83 - [c20]Hui Xiong, Xiaofeng He, Chris H. Q. Ding, Ya Zhang, Vipin Kumar, Stephen R. Holbrook:
Identification of Functional Modules in Protein Complexes via Hyperclique Pattern Discovery. Pacific Symposium on Biocomputing 2005 - [c19]Chris H. Q. Ding, Xiaofeng He:
On the Equivalence of Nonnegative Matrix Factorization and Spectral Clustering. SDM 2005: 606-610 - 2004
- [j2]Chris H. Q. Ding, Hongyuan Zha, Xiaofeng He, Parry Husbands, Horst D. Simon:
Link Analysis: Hubs and Authorities on the World Wide Web. SIAM Rev. 46(2): 256-268 (2004) - [c18]Richard F. Meraz, Xiaofeng He, Chris H. Q. Ding, Stephen R. Holbrook:
Positive Sample Only Learning (PSOL) for Predicting RNA Genes in E. coli. CSB 2004: 535-538 - [c17]Chris H. Q. Ding, Richard F. Meraz, Xiaofeng He, Stephen R. Holbrook:
Contraction Graphs for Representation and Analysis of RNA Secondary Structure. CSB 2004: 716-717 - [c15]Chris H. Q. Ding, Xiaofeng He:
Linearized cluster assignment via spectral ordering. ICML 2004 - [c14]Chris H. Q. Ding, Xiaofeng He:
K-means clustering via principal component analysis. ICML 2004 - [c13]Chris H. Q. Ding, Xiaofeng He:
Cluster Structure of K-means Clustering via Principal Component Analysis. PAKDD 2004: 414-418 - [c12]Chris H. Q. Ding, Xiaofeng He:
K-nearest-neighbor consistency in data clustering: incorporating local information into global optimization. SAC 2004: 584-589 - [c11]Chris H. Q. Ding, Xiaofeng He:
Principal Component Analysis and Effective K-Means Clustering. SDM 2004: 497-501 - 2003
- [c10]Chris H. Q. Ding, Xiaofeng He, Parry Husbands, Hongyuan Zha, Horst D. Simon:
PageRank: HITS and a Unified Framework for Link Analysis. SDM 2003: 249-253 - 2002
- [j1]Xiaofeng He, Hongyuan Zha, Chris H. Q. Ding, Horst D. Simon:
Web document clustering using hyperlink structures. Comput. Stat. Data Anal. 41(1): 19-45 (2002) - [c9]Chris H. Q. Ding, Xiaofeng He:
Cluster merging and splitting in hierarchical clustering algorithms. ICDM 2002: 139-146 - [c8]Chris H. Q. Ding, Xiaofeng He, Hongyuan Zha, Horst D. Simon:
Adaptive dimension reduction for clustering high dimensional data. ICDM 2002: 147-154 - [c7]Chris H. Q. Ding, Xiaofeng He, Hongyuan Zha, Horst D. Simon:
Unsupervised Learning: Self-aggregation in Scaled Principal Component Space. PKDD 2002: 112-124 - [c6]Chris H. Q. Ding, Xiaofeng He, Parry Husbands, Hongyuan Zha, Horst D. Simon:
PageRank, HITS and a unified framework for link analysis. SIGIR 2002: 353-354 - 2001
- [c5]Hongyuan Zha, Xiaofeng He, Chris H. Q. Ding, Ming Gu, Horst D. Simon:
Bipartite Graph Partitioning and Data Clustering. CIKM 2001: 25-32 - [c4]Chris H. Q. Ding, Xiaofeng He, Hongyuan Zha, Ming Gu, Horst D. Simon:
A Min-max Cut Algorithm for Graph Partitioning and Data Clustering. ICDM 2001: 107-114 - [c3]Xiaofeng He, Chris H. Q. Ding, Hongyuan Zha, Horst D. Simon:
Automatic Topic Identification Using Webpage Clustering. ICDM 2001: 195-202 - [c2]Chris H. Q. Ding, Xiaofeng He, Hongyuan Zha:
A spectral method to separate disconnected and nearly-disconnected web graph components. KDD 2001: 275-280 - [c1]Hongyuan Zha, Xiaofeng He, Chris H. Q. Ding, Ming Gu, Horst D. Simon:
Spectral Relaxation for K-means Clustering. NIPS 2001: 1057-1064 - [i1]Hongyuan Zha, Xiaofeng He, Chris H. Q. Ding, Ming Gu, Horst D. Simon:
Bipartite graph partitioning and data clustering. CoRR cs.IR/0108018 (2001)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-21 17:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint