Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Huida Qiu"'
Publikováno v:
Proceedings of the International AAAI Conference on Web and Social Media. 7:685-688
Learning sentiment models from short texts such as tweets is a notoriously challenging problem due to very strong noise and data sparsity. This paper presents a novel, collaborative filtering-based approach for sentiment prediction in twitter convers
Publikováno v:
IEEE Transactions on Knowledge and Data Engineering. 24:665-677
Motivated by the needs such as group relationship analysis, this paper introduces a new operation on graphs, named top-k path join, which discovers the top-k simple shortest paths between two given node sets. Rather than discovering the top-k simple
Social media anomaly detection is of critical importance to prevent malicious activities such as bullying, terrorist attack planning, and fraud information dissemination. With the recent popularity of social media, new types of anomalous behaviors ar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e7eeb96dd2de05b6e2f417c43d700af4
http://arxiv.org/abs/1601.01102
http://arxiv.org/abs/1601.01102
Publikováno v:
ICDM
Recent developments in industrial systems provide us with a large amount of time series data from sensors, logs, system settings and physical measurements, etc. These data are extremely valuable for providing insights about the complex systems and co
Publikováno v:
CIKM
With the wide applications of large scale graph data such as social networks, the problem of finding the top-k shortest paths attracts increasing attention. This paper focuses on the discovery of the top-k simple shortest paths (paths without loops).