With the increase of multi-view graph data, clustering (MVGC) that can discover hidden clusters without label supervision has attracted growing attention from researchers. Existing MVGC methods are often sensitive to given graphs, especially influenced by low quality i.e., they tend be limited homophily assumption. However, widespread real-world data hardly satisfy This gap limits performance e...

Multi-view partial multi-label learning (MVPML) is a fundenmental problem where each sample linked to multiple kinds of features and candidate labels, including ground-truth noise labels. The key MVPML how manipulate the recover labels from label set. To this end, study designs novel Graph-based Partial Multi-label model named as GMPM, which combines multi-view information detection, valuable s...

Recently, more and more approaches are emerging to solve the cross-view matching problem where reference samples and query samples are from different views. In this paper, inspired by Graph Embedding, we propose a unified framework for these cross-view methods called Cross-view Graph Embedding. The proposed framework can not only reformulate most traditional cross-view methods (e.g., CCA, PLS a...

this paper assumes the cell formation problem as a distributed decision network. it proposes an approach based on application and extension of information theory concepts, in order to analyze informational complexity in an agent- based system, due to interdependence between agents. based on this approach, new quantitative concepts and definitions are proposed in order to measure the amount of t...

Recently, multi-view clustering has received much attention in the fields of machine learning and pattern recognition. Spectral for single multiple views been common solution. Despite its good performance, it a major limitation: requires an extra step clustering. This step, which could be famous k-means clustering, depends heavily on initialization, may affect quality result. To overcome this p...

a recently published paper [t. došlić, this journal 3 (2012) 25-34] considers the zagrebindices of benzenoid systems, and points out their low discriminativity. we show thatanalogous results hold for a variety of vertex-degree-based molecular structure descriptorsthat are being studied in contemporary mathematical chemistry. we also show that theseresults are straightforwardly obtained by using...