Sciweavers

309 search results - page 27 / 62
» Expertise networks in online communities: structure and algo...
Sort
View
KDD
2012
ACM
205views Data Mining» more  KDD 2012»
11 years 10 months ago
Intrusion as (anti)social communication: characterization and detection
A reasonable definition of intrusion is: entering a community to which one does not belong. This suggests that in a network, intrusion attempts may be detected by looking for com...
Qi Ding, Natallia Katenka, Paul Barford, Eric D. K...
ICASSP
2011
IEEE
12 years 11 months ago
Content preference estimation in online social networks: Message passing versus sparse reconstruction on graphs
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
Jacob Chakareski
ESA
2010
Springer
220views Algorithms» more  ESA 2010»
13 years 8 months ago
Data Structures for Storing Small Sets in the Bitprobe Model
abstract appeared in Proc. 24th Annual Symposium of Computational Geometry (SoCG), 2008, pp. 338-345. S. Shannigrahi and S. P. Pal, "Efficient Prufer-like Coding and Counting ...
Jaikumar Radhakrishnan, Smit Shah 0001, Saswata Sh...
CIKM
2009
Springer
14 years 2 months ago
A mobile tourist assistance and recommendation system based on complex networks
In recent years, the tourism assistance community is gradually shifting its emphasis to digital, interactive systems. Our project aims for digital tourism assistance by combining ...
Alf-Christian Schering, Martin Dueffer, Andreas Fi...
EPIA
2009
Springer
14 years 2 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...