Sciweavers

455 search results - page 58 / 91
» Social search and discovery using a unified approach
Sort
View
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
16 years 2 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth
121
Voted
KDD
2004
ACM
210views Data Mining» more  KDD 2004»
16 years 2 months ago
Web usage mining based on probabilistic latent semantic analysis
The primary goal of Web usage mining is the discovery of patterns in the navigational behavior of Web users. Standard approaches, such as clustering of user sessions and discoveri...
Xin Jin, Yanzan Zhou, Bamshad Mobasher
DEBS
2008
ACM
15 years 3 months ago
Distributed automatic service composition in large-scale systems
Automatic service composition is an active research area in the field of service computing. This paper presents a distributed approach to automatically discover a composition of s...
Songlin Hu, Vinod Muthusamy, Guoli Li, Hans-Arno J...
178
Voted
GECCO
2007
Springer
558views Optimization» more  GECCO 2007»
15 years 8 months ago
A chain-model genetic algorithm for Bayesian network structure learning
Bayesian Networks are today used in various fields and domains due to their inherent ability to deal with uncertainty. Learning Bayesian Networks, however is an NP-Hard task [7]....
Ratiba Kabli, Frank Herrmann, John McCall
ICWS
2004
IEEE
15 years 3 months ago
External Matching in UDDI
As the set of available Web Services expands, it becomes increasingly important to have automated tools to help identify services that match a requester's requirements. Findi...
John Colgrave, Rama Akkiraju, Richard Goodwin