Sciweavers

2651 search results - page 176 / 531
» Mining Diversity on Networks
Sort
View
EPIA
2009
Springer
16 years 1 months ago
An Algorithm to Discover the k-Clique Cover in Networks
Abstract. In social network analysis, a k-clique is a relaxed clique, i.e., a kclique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between...
Luís Cavique, Armando B. Mendes, Jorge M. A...
DASFAA
2009
IEEE
127views Database» more  DASFAA 2009»
16 years 1 months ago
Searching for Rising Stars in Bibliography Networks
Identifying the rising stars is an important but difficult human resource exercise in all organizations. Rising stars are those who currently have relatively low profiles but may e...
Xiaoli Li, Chuan Sheng Foo, Kar Leong Tew, See-Kio...
PAKDD
2009
ACM
133views Data Mining» more  PAKDD 2009»
16 years 1 months ago
On Link Privacy in Randomizing Social Networks
Many applications of social networks require relationship anonymity due to the sensitive, stigmatizing, or confidential nature of relationship. Recent work showed that the simple ...
Xiaowei Ying, Xintao Wu
AUSDM
2007
Springer
107views Data Mining» more  AUSDM 2007»
16 years 22 days ago
Preference Networks: Probabilistic Models for Recommendation Systems
Recommender systems are important to help users select relevant and personalised information over massive amounts of data available. We propose an unified framework called Prefer...
Tran The Truyen, Dinh Q. Phung, Svetha Venkatesh
CIE
2010
Springer
15 years 11 months ago
Spatial Models for Virtual Networks
This paper discusses the use of spatial graph models for the analysis of networks that do not have a direct spatial reality, such as web graphs, on-line social networks, or citatio...
Jeannette Janssen