File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A Semisupervised Classification Approach for Multidomain Networks with Domain Selection

TitleA Semisupervised Classification Approach for Multidomain Networks with Domain Selection
Authors
Keywordsmultidomain classification
Domain selection
network integration
sparsity
semisupervised learning
Issue Date2019
Citation
IEEE Transactions on Neural Networks and Learning Systems, 2019, v. 30, n. 1, p. 269-283 How to Cite?
Abstract© 2012 IEEE. Multidomain network classification has attracted significant attention in data integration and machine learning, which can enhance network classification or prediction performance by integrating information from different sources. Despite the previous success, existing multidomain network learning methods usually assume that different views are available for the same set of instances, and thus, they seek a consistent classification result for all domains. However, in many real-world problems, each domain has its specific instance set, and one instance in one domain may correspond to multiple instances in another domain. Moreover, due to the rapid growth of data sources, different domains may not be relevant to each other, which asks for selecting domains relevant to the target/focused domain. A key challenge under this setting is how to achieve accurate prediction by integrating different data representations without losing data information. In this paper, we propose a semisupervised classification approach for a multidomain network based on label propagation, i.e., multidomain classification with domain selection (MCS), which can deal with the cross-domain information and different instance sets in domains. In particular, with sparse weight properties, the proposed MCS can automatically identify those domains relevant to our target domain by assigning them higher weights than the other irrelevant domains. This not only significantly improves a classification accuracy but also helps to obtain optimal network partition for the target domain. From the theoretical viewpoint, we equivalently decompose MCS into two simpler subproblems with analytical solutions, which can be efficiently solved by their computational procedures. Extensive experimental results on both synthetic and real-world data sets empirically demonstrate the advantages of the proposed approach in terms of both prediction performance and domain selection ability.
Persistent Identifierhttp://hdl.handle.net/10722/276775
ISSN
2021 Impact Factor: 14.255
2020 SCImago Journal Rankings: 2.882
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorChen, Chuan-
dc.contributor.authorXin, Jingxue-
dc.contributor.authorWang, Yong-
dc.contributor.authorChen, Luonan-
dc.contributor.authorNg, Michael K.-
dc.date.accessioned2019-09-18T08:34:37Z-
dc.date.available2019-09-18T08:34:37Z-
dc.date.issued2019-
dc.identifier.citationIEEE Transactions on Neural Networks and Learning Systems, 2019, v. 30, n. 1, p. 269-283-
dc.identifier.issn2162-237X-
dc.identifier.urihttp://hdl.handle.net/10722/276775-
dc.description.abstract© 2012 IEEE. Multidomain network classification has attracted significant attention in data integration and machine learning, which can enhance network classification or prediction performance by integrating information from different sources. Despite the previous success, existing multidomain network learning methods usually assume that different views are available for the same set of instances, and thus, they seek a consistent classification result for all domains. However, in many real-world problems, each domain has its specific instance set, and one instance in one domain may correspond to multiple instances in another domain. Moreover, due to the rapid growth of data sources, different domains may not be relevant to each other, which asks for selecting domains relevant to the target/focused domain. A key challenge under this setting is how to achieve accurate prediction by integrating different data representations without losing data information. In this paper, we propose a semisupervised classification approach for a multidomain network based on label propagation, i.e., multidomain classification with domain selection (MCS), which can deal with the cross-domain information and different instance sets in domains. In particular, with sparse weight properties, the proposed MCS can automatically identify those domains relevant to our target domain by assigning them higher weights than the other irrelevant domains. This not only significantly improves a classification accuracy but also helps to obtain optimal network partition for the target domain. From the theoretical viewpoint, we equivalently decompose MCS into two simpler subproblems with analytical solutions, which can be efficiently solved by their computational procedures. Extensive experimental results on both synthetic and real-world data sets empirically demonstrate the advantages of the proposed approach in terms of both prediction performance and domain selection ability.-
dc.languageeng-
dc.relation.ispartofIEEE Transactions on Neural Networks and Learning Systems-
dc.subjectmultidomain classification-
dc.subjectDomain selection-
dc.subjectnetwork integration-
dc.subjectsparsity-
dc.subjectsemisupervised learning-
dc.titleA Semisupervised Classification Approach for Multidomain Networks with Domain Selection-
dc.typeArticle-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/TNNLS.2018.2837166-
dc.identifier.pmid29994273-
dc.identifier.scopuseid_2-s2.0-85048559920-
dc.identifier.volume30-
dc.identifier.issue1-
dc.identifier.spage269-
dc.identifier.epage283-
dc.identifier.eissn2162-2388-
dc.identifier.isiWOS:000454329300022-
dc.identifier.issnl2162-237X-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats