Sciweavers

3017 search results - page 63 / 604
» On compressing social networks
Sort
View
SOCIALCOM
2010
13 years 6 months ago
Measuring Similarity between Sets of Overlapping Clusters
The typical task of unsupervised learning is to organize data, for example into clusters, typically disjoint clusters (eg. the K-means algorithm). One would expect (for example) a...
Mark K. Goldberg, Mykola Hayvanovych, Malik Magdon...
ICDM
2010
IEEE
186views Data Mining» more  ICDM 2010»
13 years 6 months ago
MoodCast: Emotion Prediction via Dynamic Continuous Factor Graph Model
Human emotion is one important underlying force affecting and affected by the dynamics of social networks. An interesting question is "can we predict a person's mood base...
Yuan Zhang, Jie Tang, Jimeng Sun, Yiran Chen, Jing...
BIS
2008
134views Business» more  BIS 2008»
13 years 10 months ago
Trustlet, Open Research on Trust Metrics
A trust metric is a technique for predicting how much a user of a social network might trust another user. This is especially beneficial in situations where most users are unknown ...
Paolo Massa, Kasper Souren
CSE
2009
IEEE
14 years 4 days ago
Clustering Signature in Complex Social Networks
An important aspect in social computing is the structure of social networks, which build the underlying substrate for the exchange of information. With the growing importance of mi...
Ueli Peter, Tomas Hruz
CIKM
2008
Springer
13 years 10 months ago
Efficient sampling of information in social networks
As online social networking emerges, there has been increased interest to utilize the underlying social structure as well as the available social information to improve search. In...
Gautam Das, Nick Koudas, Manos Papagelis, Sushruth...