The present teaching relates to determining user interests based on a correspondence graph. In one example, correspondences among a plurality of users are obtained. Connections among at least some of the plurality of users are identified based on the correspondences. A graph is constructed based on the identified connections. Each of the identified connections has a strength determined based on correspondences associated with the identified connection. One or more seed users are selected from the plurality of users. Each of the one or more seed users has at least one known interest. An interest is determined for each of the at least some of the plurality of users based on the graph and the known interests of the one or more seed users.