✦ LIBER ✦

Dual-graph regularized concept factorization for clustering

✍ Scribed by Ye, Jun; Jin, Zhong

Book ID: 122272248
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 453 KB
Volume: 138
Category: Article
ISSN: 0925-2312
DOI: 10.1016/j.neucom.2014.02.029

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Image clustering by hyper-graph regulari

Image clustering by hyper-graph regularized non-negative matrix factorization

✍ Zeng, Kun; Yu, Jun; Li, Cuihua; You, Jane; Jin, Taisong 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 792 KB

Graph dual regularization non-negative m

Graph dual regularization non-negative matrix factorization for co-clustering

✍ Fanhua Shang; L.C. Jiao; Fei Wang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 692 KB

Graph regularized discriminative non-neg

Graph regularized discriminative non-negative matrix factorization for face recognition

✍ Xianzhong Long, Hongtao Lu, Yong Peng, Wenbin Li 📂 Article 📅 2013 🏛 Springer US 🌐 English ⚖ 751 KB

Semi-supervised non-negative matrix fact

Semi-supervised non-negative matrix factorization for image clustering with graph Laplacian

✍ He, Yangcheng; Lu, Hongtao; Xie, Saining 📂 Article 📅 2013 🏛 Springer US 🌐 English ⚖ 761 KB

A nonnegative matrix factorization frame

A nonnegative matrix factorization framework for semi-supervised document clustering with dual constraints

✍ Huifang Ma, Weizhong Zhao, Zhongzhi Shi 📂 Article 📅 2012 🏛 Springer-Verlag 🌐 English ⚖ 602 KB

A degree condition for the existence of

A degree condition for the existence of regular factors inK1,n-free graphs

✍ Ota, Katsuhiro; Tokuda, Taro 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 260 KB 👁 2 views

A graph is called K1,.-free if it contains no K l , n as an induced subgraph. Let n ( r 3), r be integers (if r is odd, r 2 n -1). We prove that every Kl,,-free connected graph G with rlV(G)I even has an r-factor if its minimum degree is at least This degree condition is sharp.