-
Li, D.; Tang, J.; Ding, Y.; Shuai, X.; Chambers, T.; Sun, G.; Luo, Z.; Zhang, J.: Topic-level opinion influence model (TOIM) : an investigation using tencent microblogging (2015)
0.02
0.01993374 = product of:
0.03986748 = sum of:
0.03986748 = product of:
0.07973496 = sum of:
0.07973496 = weight(_text_:network in 2345) [ClassicSimilarity], result of:
0.07973496 = score(doc=2345,freq=4.0), product of:
0.22917621 = queryWeight, product of:
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.05146125 = queryNorm
0.34791988 = fieldWeight in 2345, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.0390625 = fieldNorm(doc=2345)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- Text mining has been widely used in multiple types of user-generated data to infer user opinion, but its application to microblogging is difficult because text messages are short and noisy, providing limited information about user opinion. Given that microblogging users communicate with each other to form a social network, we hypothesize that user opinion is influenced by its neighbors in the network. In this paper, we infer user opinion on a topic by combining two factors: the user's historical opinion about relevant topics and opinion influence from his/her neighbors. We thus build a topic-level opinion influence model (TOIM) by integrating both topic factor and opinion influence factor into a unified probabilistic model. We evaluate our model in one of the largest microblogging sites in China, Tencent Weibo, and the experiments show that TOIM outperforms baseline methods in opinion inference accuracy. Moreover, incorporating indirect influence further improves inference recall and f1-measure. Finally, we demonstrate some useful applications of TOIM in analyzing users' behaviors in Tencent Weibo.
-
Ru, C.; Tang, J.; Li, S.; Xie, S.; Wang, T.: Using semantic similarity to reduce wrong labels in distant supervision for relation extraction (2018)
0.02
0.01993374 = product of:
0.03986748 = sum of:
0.03986748 = product of:
0.07973496 = sum of:
0.07973496 = weight(_text_:network in 5055) [ClassicSimilarity], result of:
0.07973496 = score(doc=5055,freq=4.0), product of:
0.22917621 = queryWeight, product of:
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.05146125 = queryNorm
0.34791988 = fieldWeight in 5055, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.0390625 = fieldNorm(doc=5055)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- Distant supervision (DS) has the advantage of automatically generating large amounts of labelled training data and has been widely used for relation extraction. However, there are usually many wrong labels in the automatically labelled data in distant supervision (Riedel, Yao, & McCallum, 2010). This paper presents a novel method to reduce the wrong labels. The proposed method uses the semantic Jaccard with word embedding to measure the semantic similarity between the relation phrase in the knowledge base and the dependency phrases between two entities in a sentence to filter the wrong labels. In the process of reducing wrong labels, the semantic Jaccard algorithm selects a core dependency phrase to represent the candidate relation in a sentence, which can capture features for relation classification and avoid the negative impact from irrelevant term sequences that previous neural network models of relation extraction often suffer. In the process of relation classification, the core dependency phrases are also used as the input of a convolutional neural network (CNN) for relation classification. The experimental results show that compared with the methods using original DS data, the methods using filtered DS data performed much better in relation extraction. It indicates that the semantic similarity based method is effective in reducing wrong labels. The relation extraction performance of the CNN model using the core dependency phrases as input is the best of all, which indicates that using the core dependency phrases as input of CNN is enough to capture the features for relation classification and could avoid negative impact from irrelevant terms.
-
Li, D.; Ding, Y.; Sugimoto, C.; He, B.; Tang, J.; Yan, E.; Lin, N.; Qin, Z.; Dong, T.: Modeling topic and community structure in social tagging : the TTR-LDA-Community model (2011)
0.01
0.014095282 = product of:
0.028190564 = sum of:
0.028190564 = product of:
0.05638113 = sum of:
0.05638113 = weight(_text_:network in 4759) [ClassicSimilarity], result of:
0.05638113 = score(doc=4759,freq=2.0), product of:
0.22917621 = queryWeight, product of:
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.05146125 = queryNorm
0.2460165 = fieldWeight in 4759, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.0390625 = fieldNorm(doc=4759)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- The presence of social networks in complex systems has made networks and community structure a focal point of study in many domains. Previous studies have focused on the structural emergence and growth of communities and on the topics displayed within the network. However, few scholars have closely examined the relationship between the thematic and structural properties of networks. Therefore, this article proposes the Tagger Tag Resource-Latent Dirichlet Allocation-Community model (TTR-LDA-Community model), which combines the Latent Dirichlet Allocation (LDA) model with the Girvan-Newman community detection algorithm through an inference mechanism. Using social tagging data from Delicious, this article demonstrates the clustering of active taggers into communities, the topic distributions within communities, and the ranking of taggers, tags, and resources within these communities. The data analysis evaluates patterns in community structure and topical affiliations diachronically. The article evaluates the effectiveness of community detection and the inference mechanism embedded in the model and finds that the TTR-LDA-Community model outperforms other traditional models in tag prediction. This has implications for scholars in domains interested in community detection, profiling, and recommender systems.
