Остановите войну!
for scientists:
default search action
Dijun Luo
Publications
- 2016
- [c28]Dijun Luo, Zhouyuan Huo, Yang Wang, Andrew J. Saykin, Li Shen, Heng Huang:
New Probabilistic Multi-graph Decomposition Model to Identify Consistent Human Brain Network Modules. ICDM 2016: 301-310 - 2014
- [c27]Dijun Luo, Heng Huang:
Video Motion Segmentation Using New Adaptive Manifold Denoising Model. CVPR 2014: 65-72 - 2013
- [j3]Dijun Luo, Chris H. Q. Ding, Heng Huang:
Toward structural sparsity: an explicit ℓ2/ℓ0 approach. Knowl. Inf. Syst. 36(2): 411-438 (2013) - 2012
- [c25]Dijun Luo, Chris H. Q. Ding, Heng Huang:
Parallelization with Multiplicative Algorithms for Big Data Mining. ICDM 2012: 489-498 - [c24]Dijun Luo, Chris H. Q. Ding, Heng Huang, Feiping Nie:
Forging The Graphs: A Low Rank and Positive Semidefinite Graph Learning Approach. NIPS 2012: 2969-2977 - 2011
- [c22]Dijun Luo, Chris H. Q. Ding, Heng Huang:
Linear Discriminant Analysis: New Formulations and Overfit Analysis. AAAI 2011: 417-422 - [c21]Dijun Luo, Chris H. Q. Ding, Heng Huang:
Multi-Level Cluster Indicator Decompositions of Matrices and Tensors. AAAI 2011: 423-428 - [c20]Dijun Luo, Heng Huang, Chris H. Q. Ding:
Discriminative high order SVD: Adaptive tensor subspace selection for image classification, clustering, and retrieval. ICCV 2011: 1443-1448 - [c19]Dijun Luo, Chris H. Q. Ding, Heng Huang, Feiping Nie:
Consensus spectral clustering in near-linear time. ICDE 2011: 1079-1090 - [c18]Dijun Luo, Chris H. Q. Ding, Feiping Nie, Heng Huang:
Cauchy Graph Embedding. ICML 2011: 553-560 - [c17]Dijun Luo, Chris H. Q. Ding, Heng Huang:
Cluster Indicator Decomposition for Efficient Matrix Factorization. IJCAI 2011: 1384-1389 - [c16]Dijun Luo, Heng Huang:
Ball Ranking Machine for Content-Based Multimedia Retrieval. IJCAI 2011: 1390-1395 - [c15]Feiping Nie, Heng Huang, Chris H. Q. Ding, Dijun Luo, Hua Wang:
Robust Principal Component Analysis with Non-Greedy l1-Norm Maximization. IJCAI 2011: 1433-1438 - [c13]Dijun Luo, Chris H. Q. Ding, Heng Huang:
Are Tensor Decomposition Solutions Unique? On the Global Convergence HOSVD and ParaFac Algorithms. PAKDD (1) 2011: 148-159 - [c12]Dijun Luo, Chris H. Q. Ding, Heng Huang:
Graph Evolution via Social Diffusion Processes. ECML/PKDD (2) 2011: 390-404 - [c11]Dijun Luo, Feiping Nie, Chris H. Q. Ding, Heng Huang:
Multi-Subspace Representation and Discovery. ECML/PKDD (2) 2011: 405-420 - 2010
- [j2]Dijun Luo, Heng Huang, Chris H. Q. Ding, Feiping Nie:
On the eigenvectors of p-Laplacian. Mach. Learn. 81(1): 37-51 (2010) - [c9]Dijun Luo, Chris H. Q. Ding, Heng Huang:
Towards Structural Sparsity: An Explicit l2/l0 Approach. ICDM 2010: 344-353 - [c8]Feiping Nie, Chris H. Q. Ding, Dijun Luo, Heng Huang:
Improved MinMax Cut Graph Clustering with Nonnegative Relaxation. ECML/PKDD (2) 2010: 451-466 - 2009
- [c7]Dijun Luo, Chris H. Q. Ding, Heng Huang:
Symmetric two dimensional linear discriminant analysis (2DLDA). CVPR 2009: 2820-2827 - [c6]Dijun Luo, Chris H. Q. Ding, Heng Huang, Tao Li:
Non-negative Laplacian Embedding. ICDM 2009: 337-346 - [c5]Dijun Luo, Heng Huang:
Link prediction of multimedia social network via unsupervised face recognition. ACM Multimedia 2009: 805-808 - [i1]Dijun Luo, Heng Huang, Chris H. Q. Ding:
Are Tensor Decomposition Solutions Unique? On the global convergence of HOSVD and ParaFac algorithms. CoRR abs/0902.4521 (2009) - 2008
- [c4]Chris H. Q. Ding, Heng Huang, Dijun Luo:
Tensor reduction error analysis - Applications to video compression and classification. CVPR 2008 - [c3]Heng Huang, Chris H. Q. Ding, Dijun Luo, Tao Li:
Simultaneous tensor subspace selection and clustering: the equivalence of high order svd and k-means clustering. KDD 2008: 327-335
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:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint