ASUNAM
2010
IEEE
13 years 6 months ago
2010
IEEE
Subgraph matching is a key operation on graph data. Social network (SN) providers may want to find all subgraphs within their social network that "match" certain query gr...
ASUNAM
2010
IEEE
13 years 6 months ago
2010
IEEE
ASUNAM
2010
IEEE
13 years 6 months ago
2010
IEEE
This paper aims at studying the roles of social features (as obtained from social networking sources) in buyers' decision process when they are searching for products to buy. ...
ASUNAM
2010
IEEE
13 years 6 months ago
2010
IEEE
The last decade has seen an explosion in blogging and the blogosphere is continuing to grow, having a large global reach and many vibrant communities. Researchers have been pouring...
ASUNAM
2010
IEEE
13 years 6 months ago
2010
IEEE
The goal of semi-supervised learning (SSL) methods is to reduce the amount of labeled training data required by learning from both labeled and unlabeled instances. Macskassy and Pr...
ASUNAM
2010
IEEE
13 years 6 months ago
2010
IEEE
Real-world social networks from a variety of domains can naturally be modelled as dynamic graphs. However, approaches to detecting communities have largely focused on identifying ...
ASUNAM
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
ASUNAM
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract--As research into community finding in social networks progresses, there is a need for algorithms capable of detecting overlapping community structure. Many algorithms hav...
ASUNAM
2010
IEEE
13 years 6 months ago
2010
IEEE
:
ASUNAM
2010
IEEE
13 years 6 months ago
2010
IEEE
Problem resolution is a key issue in the IT service industry. A large service provider handles, on daily basis, thousands of tickets that report various types of problems from its...