Computer Science – Information Theory
Scientific paper
2011-09-15
Computer Science
Information Theory
9 pages, 7 figures, KDD 2011: The 17th ACM SIGKDD Conference on Knowledge Discovery and Data Mining
Scientific paper
In many real-world networks, nodes have class labels, attributes, or variables that affect the network's topology. If the topology of the network is known but the labels of the nodes are hidden, we would like to select a small subset of nodes such that, if we knew their labels, we could accurately predict the labels of all the other nodes. We develop an active learning algorithm for this problem which uses information-theoretic techniques to choose which nodes to explore. We test our algorithm on networks from three different domains: a social network, a network of English words that appear adjacently in a novel, and a marine food web. Our algorithm makes no initial assumptions about how the groups connect, and performs well even when faced with quite general types of network structure. In particular, we do not assume that nodes of the same class are more likely to be connected to each other---only that they connect to the rest of the network in similar ways.
Lane Terran
Moore Cristopher
Rouquier Jean-Baptiste
Yan Xiaoran
Zhu Yaojia
No associations
LandOfFree
Active Learning for Node Classification in Assortative and Disassortative Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Active Learning for Node Classification in Assortative and Disassortative Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Active Learning for Node Classification in Assortative and Disassortative Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-672218