Search results

The current study investigates the impact on perceived review helpfulness of the simultaneous processing of information from multiple cues with various central and peripheral cue combinations based on the elaboration likelihood model (ELM). Thus, the current study develops and tests hypotheses by analyzing real-world review data with a text mining approach in e-commerce to investigate how information consistency (rating inconsistency, review consistency and text similarity) influences perceived helpfulness. Moreover, the role of product type is examined in online consumer reviews of perceived helpfulness.

The current study collected 61,900 online reviews, including 600 products in six categories, from Amazon.com. Additionally, 51,927 reviews were filtered that received helpfulness votes, and then text mining and negative binomial regression were applied.

The current study found that rating inconsistency and text similarity negatively affect perceived helpfulness and that review consistency positively affects perceived helpfulness. Moreover, peripheral cues (rating inconsistency) positively affect perceived helpfulness in reviews of experience goods rather than search goods. However, there is a lack of evidence to demonstrate the hypothesis that product types moderate the effectiveness of central cues (review consistency and text similarity) on perceived helpfulness.

Previous studies have mainly focused on numerical and textual factors to investigate the effect on perceived helpfulness. Additionally, previous studies have independently confirmed the factors that affect perceived helpfulness. The current study investigated how information consistency affects perceived helpfulness and found that various combinations of cues significantly affect perceived helpfulness. This result contributes to the review helpfulness and ELM literature by identifying the impact on perceived helpfulness from a comprehensive perspective of consumer review and information consistency.

The identification of network user relationship in Fancircle contributes to quantifying the violence index of user text, mining the internal correlation of network behaviors among users, which provides necessary data support for the construction of knowledge graph.

A correlation identification method based on sentiment analysis (CRDM-SA) is put forward by extracting user semantic information, as well as introducing violent sentiment membership. To be specific, the topic of the implementation of topology mapping in the community can be obtained based on self-built field of violent sentiment dictionary (VSD) by extracting user text information. Afterward, the violence index of the user text is calculated to quantify the fuzzy sentiment representation between the user and the topic. Finally, the multi-granularity violence association rules mining of user text is realized by constructing violence fuzzy concept lattice.

It is helpful to reveal the internal relationship of online violence under complex network environment. In that case, the sentiment dependence of users can be characterized from a granular perspective.

The membership degree of violent sentiment into user relationship recognition in Fancircle community is introduced, and a text sentiment association recognition method based on VSD is proposed. By calculating the value of violent sentiment in the user text, the annotation of violent sentiment in the topic dimension of the text is achieved, and the partial order relation between fuzzy concepts of violence under the effective confidence threshold is utilized to obtain the association relation.

Question answering (QA) answers the questions asked by people in the form of natural language. In the QA, due to the subjectivity of users, the questions they query have different expressions, which increases the difficulty of text retrieval. Therefore, the purpose of this paper is to explore new query rewriting method for QA that integrates multiple related questions (RQs) to form an optimal question. Moreover, it is important to generate a new dataset of the original query (OQ) with multiple RQs.

This study collects a new dataset SQuAD_extend by crawling the QA community and uses word-graph to model the collected OQs. Next, Beam search finds the best path to get the best question. To deeply represent the features of the question, pretrained model BERT is used to model sentences.

The experimental results show three outstanding findings. (1) The quality of the answers is better after adding the RQs of the OQs. (2) The word-graph that is used to model the problem and choose the optimal path is conducive to finding the best question. (3) Finally, BERT can deeply characterize the semantics of the exact problem.

The proposed method can use word-graph to construct multiple questions and select the optimal path for rewriting the question, and the quality of answers is better than the baseline. In practice, the research results can help guide users to clarify their query intentions and finally achieve the best answer.

In times of crisis, such as the Covid-19 global pandemic, journalists who write about biomedical information must have the strategic aim to be clearly and easily understood by everyone. In this study, we assume that journalistic discourse could benefit from language redundancy to improve clarity and simplicity aimed at science popularization. The concept of language redundancy is theoretically discussed with the support of discourse analysis and information theory. The methodology adopted is a corpus-based qualitative approach. Two corpora samples with Brazilian Portuguese (BP) texts on Covid-19 were collected. One with texts from a monthly science digital magazine called Pesquisa FAPESP aimed at students and researchers for scientific information dissemination and the other with popular language texts from a news Portal G1 (Rede Globo) aimed at unspecified and/or non-specialized readers. The materials were filtered with two descriptors: “vaccine” and “test.” Preliminary analysis of examples from these materials revealed two categories of redundancy: paraphrastic and polysemic. Paraphrastic redundancy is based on concomitant language reformulation of words, sentences, text excerpts, or even larger units. Polysemic redundancy does not easily show material evidence, but is based on cognitively predictable semantic association in socio-cultural domains. Both kinds of redundancy contribute, each in their own way, to improving text readability for science popularization in Brazil.

Scholars of persuasion have long made a distinction between appeals to logic, emotion and authority- logos, ethos and pathos- but ideas developed to account for live face-to-face conversation processes must also be tested in new media. We aimed to test the effectiveness of these three strategies in one-to-one chats through different communication media.

With a 3 × 3 × 2 between-subject factorial design, we tested these three strategies in one-to-one chats (female–female or male–male pairs) through three communication media: face-to-face, Skype video or Skype text. The persuasion scenario was adapted from prior studies in which students were presented with the idea of requiring a comprehensive exam as part of their degree. The participants were all undergraduate students of a major university in USA.

Our results showed trivial differences between female–female and male–male conditions. The logos appeal worked best overall in persuading the participants to change their reported attitudes. Additionally, the explanations provided by the participants for their own opinions were most like the persuasion scripts in the logos condition compared to the other two appeal conditions. Separately, participants indicated some disapproval of the pathos appeal in the text-based chat condition, although this did not seem to make a difference in terms of actual attitude change.

One major limitation of our study is that our subjects are college students and therefore are not representative of Internet users in general. Future research should test these three types of persuasion strategies on people of diverse backgrounds. For example, while logos seems to be most effective strategy in persuading college students (at least in our study), pathos or ethos may be more effective when one attempts to persuade people of different backgrounds.

Although it is enough for a statistical test, our sample size is still relatively small due to constraints on time, personnel and funding. We also recognize that it is challenging both conceptually and empirically to compare the effectiveness of three persuasion strategies separately.

Our findings suggest it is helpful to use fact-checking tools to combat disinformation in cases where users may not have sufficient domain knowledge or may not realize the need to identify or examine the given information. Additionally, it may require more effort to negate the impact of the disinformation spread than correcting the information, as some users may not only believe false information but also may start to reason in ways similar to those presented in the disinformation messages.

Past studies on online persuasion have limitedly examined whether and how communication media and persuasion strategies interact in one-to-one persuasion sessions. Our experiment makes an attempt to close this gap by examining the persuasion process and outcome in three different communication media and with three different persuasion strategies.

Propaganda is a prevalent technique used in social media to intentionally express opinions or actions with the aim of manipulating or deceiving users. Existing methods for propaganda detection primarily focus on capturing language features within its content. However, these methods tend to overlook the information presented within the external news environment from which propaganda news originated and spread. This news environment reflects recent mainstream media opinions and public attention and contains language characteristics of non-propaganda news. Therefore, the authors have proposed a graph-based multi-information integration network with an external news environment (abbreviated as G-MINE) for propaganda detection.

G-MINE is proposed to comprise four parts: textual information extraction module, external news environment perception module, multi-information integration module and classifier. Specifically, the external news environment perception module and multi-information integration module extract and integrate the popularity and novelty into the textual information and capture the high-order complementary information between them.

G-MINE achieves state-of-the-art performance on both the TSHP-17, Qprop and the PTC data sets, with an accuracy of 98.24%, 90.59% and 97.44%, respectively.

An external news environment perception module is proposed to capture the popularity and novelty information, and a multi-information integration module is proposed to effectively fuse them with the textual information.

In the era of artificial intelligence (AI), algorithms have gained unprecedented importance. Scientific studies have shown that algorithms are frequently mentioned in papers, making mention frequency a classical indicator of their popularity and influence. However, contemporary methods for evaluating influence tend to focus solely on individual algorithms, disregarding the collective impact resulting from the interconnectedness of these algorithms, which can provide a new way to reveal their roles and importance within algorithm clusters. This paper aims to build the co-occurrence network of algorithms in the natural language processing field based on the full-text content of academic papers and analyze the academic influence of algorithms in the group based on the features of the network.

We use deep learning models to extract algorithm entities from articles and construct the whole, cumulative and annual co-occurrence networks. We first analyze the characteristics of algorithm networks and then use various centrality metrics to obtain the score and ranking of group influence for each algorithm in the whole domain and each year. Finally, we analyze the influence evolution of different representative algorithms.

The results indicate that algorithm networks also have the characteristics of complex networks, with tight connections between nodes developing over approximately four decades. For different algorithms, algorithms that are classic, high-performing and appear at the junctions of different eras can possess high popularity, control, central position and balanced influence in the network. As an algorithm gradually diminishes its sway within the group, it typically loses its core position first, followed by a dwindling association with other algorithms.

To the best of the authors’ knowledge, this paper is the first large-scale analysis of algorithm networks. The extensive temporal coverage, spanning over four decades of academic publications, ensures the depth and integrity of the network. Our results serve as a cornerstone for constructing multifaceted networks interlinking algorithms, scholars and tasks, facilitating future exploration of their scientific roles and semantic relations.

With the increasing number of Web services, correct and efficient classification of Web services is crucial to improve the efficiency of service discovery. However, existing Web service classification approaches ignore the class overlap in Web services, resulting in poor accuracy of classification in practice. This paper aims to provide an approach to address this issue.

This paper proposes a label confusion and priori correction-based Web service classification approach. First, functional semantic representations of Web services descriptions are obtained based on BERT. Then, the ability of the model is enhanced to recognize and classify overlapping instances by using label confusion learning techniques; Finally, the predictive results are corrected based on the label prior distribution to further improve service classification effectiveness.

Experiments based on the ProgrammableWeb data set show that the proposed model demonstrates 4.3%, 3.2% and 1% improvement in Macro-F1 value compared to the ServeNet-BERT, BERT-DPCNN and CARL-NET, respectively.

This paper proposes a Web service classification approach for the overlapping categories of Web services and improve the accuracy of Web services classification.

The article extends the distinction of semantic from syntactic labour to comprehend all forms of mental labour. It answers a critique from de Fremery and Buckland, which required envisaging mental labour as a differentiated spectrum.

The paper adopts a discursive approach. It first reviews the significance and extensive diffusion of the distinction of semantic from syntactic labour. Second, it integrates semantic and syntactic labour along a vertical dimension within mental labour, indicating analogies in principle with, and differences in application from, the inherited distinction of intellectual from clerical labour. Third, it develops semantic labour to the very highest level, on a consistent principle of differentiation from syntactic labour. Finally, it reintegrates the understanding developed of semantic labour with syntactic labour, confirming that they can fully and informatively occupy mental labour.

The article further validates the distinction of semantic from syntactic labour. It enables to address Norbert Wiener's classic challenge of appropriately distributing activity between human and computer.

The article transforms work in progress into knowledge for diffusion.

It has practical implications for determining what tasks to delegate to computational technology.

The paper has social implications for the understanding of appropriate human and machine computational tasks and our own distinctive humanness.

The paper is highly original. Although based on preceding research, from the late 20th century, it is the first separately published full account of semantic and syntactic labour.

The purpose of this study is to develop a domain independent, cost-effective, time-saving and semi-automated ontology generation framework that could extract taxonomic concepts from unstructured text corpus. In the human disease domain, ontologies are found to be extremely useful for managing the diversity of technical expressions in favour of information retrieval objectives. The boundaries of these domains are expanding so fast that it is essential to continuously develop new ontologies or upgrade available ones.

This paper proposes a semi-automated approach that extracts entities/relations via text mining of scientific publications. Text mining-based ontology (TmbOnt)-named code is generated to assist a user in capturing, processing and establishing ontology elements. This code takes a pile of unstructured text files as input and projects them into high-valued entities or relations as output. As a semi-automated approach, a user supervises the process, filters meaningful predecessor/successor phrases and finalizes the demanded ontology-taxonomy. To verify the practical capabilities of the scheme, a case study was performed to drive glaucoma ontology-taxonomy. For this purpose, text files containing 10,000 records were collected from PubMed.

The proposed approach processed over 3.8 million tokenized terms of those records and yielded the resultant glaucoma ontology-taxonomy. Compared with two famous disease ontologies, TmbOnt-driven taxonomy demonstrated a 60%–100% coverage ratio against famous medical thesauruses and ontology taxonomies, such as Human Disease Ontology, Medical Subject Headings and National Cancer Institute Thesaurus, with an average of 70% additional terms recommended for ontology development.

According to the literature, the proposed scheme demonstrated novel capability in expanding the ontology-taxonomy structure with a semi-automated text mining approach, aiming for future fully-automated approaches.