Sciweavers

375 search results - page 45 / 75
» An Algorithm to Find Overlapping Community Structure in Netw...
Sort
View
PKDD
2000
Springer
100views Data Mining» more  PKDD 2000»
13 years 11 months ago
Learning Right Sized Belief Networks by Means of a Hybrid Methodology
Previous algoritms for the construction of belief networks structures from data are mainly based either on independence criteria or on scoring metrics. The aim of this paper is to ...
Silvia Acid, Luis M. de Campos
WWW
2010
ACM
13 years 7 months ago
SNDocRank: document ranking based on social networks
To improve the search results for socially-connect users, we propose a ranking framework, Social Network Document Rank (SNDocRank). This framework considers both document contents...
Liang Gou, Hung-Hsuan Chen, Jung-Hyun Kim, Xiaolon...
AAIM
2007
Springer
118views Algorithms» more  AAIM 2007»
13 years 11 months ago
Significance-Driven Graph Clustering
Abstract. Modularity, the recently defined quality measure for clusterings, has attained instant popularity in the fields of social and natural sciences. We revisit the rationale b...
Marco Gaertler, Robert Görke, Dorothea Wagner
DAWAK
2006
Springer
13 years 11 months ago
A Greedy Approach to Concurrent Processing of Frequent Itemset Queries
We consider the problem of concurrent execution of multiple frequent itemset queries. If such data mining queries operate on overlapping parts of the database, then their overall I...
Pawel Boinski, Marek Wojciechowski, Maciej Zakrzew...
ITNG
2008
IEEE
14 years 1 months ago
An Efficient Technique for Distance Computation in Road Networks
With recent advances in wireless communication and position technologies, it became possible to collect and record trajectories of moving objects. Thus, many services in road netw...
Xu Jianqiu, Victor Teixeira de Almeida, Qin Xiaoli...