Sciweavers

11862 search results - page 2180 / 2373
» Relative information completeness
Sort
View
CCS
2009
ACM
16 years 5 months ago
The union-split algorithm and cluster-based anonymization of social networks
Knowledge discovery on social network data can uncover latent social trends and produce valuable findings that benefit the welfare of the general public. A growing amount of resea...
Brian Thompson, Danfeng Yao
SPAA
2009
ACM
16 years 5 months ago
On randomized representations of graphs using short labels
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
Pierre Fraigniaud, Amos Korman
KDD
2009
ACM
152views Data Mining» more  KDD 2009»
16 years 5 months ago
TANGENT: a novel, 'Surprise me', recommendation algorithm
Most of recommender systems try to find items that are most relevant to the older choices of a given user. Here we focus on the "surprise me" query: A user may be bored ...
Kensuke Onuma, Hanghang Tong, Christos Faloutsos
KDD
2009
ACM
230views Data Mining» more  KDD 2009»
16 years 5 months ago
Analyzing patterns of user content generation in online social networks
Various online social networks (OSNs) have been developed rapidly on the Internet. Researchers have analyzed different properties of such OSNs, mainly focusing on the formation an...
Lei Guo, Enhua Tan, Songqing Chen, Xiaodong Zhang,...
KDD
2008
ACM
195views Data Mining» more  KDD 2008»
16 years 5 months ago
Learning from multi-topic web documents for contextual advertisement
Contextual advertising on web pages has become very popular recently and it poses its own set of unique text mining challenges. Often advertisers wish to either target (or avoid) ...
Yi Zhang, Arun C. Surendran, John C. Platt, Mukund...
« Prev « First page 2180 / 2373 Last » Next »