Active Learning for Hidden Attributes in Networks

Details Active Learning for Hidden Attributes in Networks Active Learning for Hidden Attributes in Networks

2010-05-05

arxiv.org/abs/1005.0794v1

Statistics

Machine Learning

Scientific paper

In many networks, vertices have hidden attributes, or types, that are correlated with the networks topology. If the topology is known but these attributes are not, and if learning the attributes is costly, we need a method for choosing which vertex to query in order to learn as much as possible about the attributes of the other vertices. We assume the network is generated by a stochastic block model, but we make no assumptions about its assortativity or disassortativity. We choose which vertex to query using two methods: 1) maximizing the mutual information between its attributes and those of the others (a well-known approach in active learning) and 2) maximizing the average agreement between two independent samples of the conditional Gibbs distribution. Experimental results show that both these methods do much better than simple heuristics. They also consistently identify certain vertices as important by querying them early on.

Affiliated with

Also associated with

No associations

Rating

Active Learning for Hidden Attributes in 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 Hidden Attributes in Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Active Learning for Hidden Attributes in Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-437703