Real-time rumor detection methods that do not rely on propagation features have emerged as an effective strategy to curb the spread of misinformation. To address the pressing challenge of enhancing semantic understanding of short texts and extracting latent user features in real-time rumor detection, this article proposes a novel approach that integrates B ackground K nowledge and U ser F eatures (BKUF). First, relevant background knowledge is extracted from an external knowledge graph through knowledge distillation. To accommodate different granularities of knowledge, we design two fusion strategies: one based on graph attention networks and the other on co-attention mechanisms, effectively enriching the semantic representation of the text. In addition to traditional user features, we further introduce two novel latent user attributes—rationality and professionalism—which are inferred from users’ historical posts. Finally, the enhanced semantic and user features are adaptively integrated and passed into a multi-layer perceptron for classification. Experiments conducted on four widely used public rumor datasets—Weibo, PHEME, Twitter15, and Twitter16—show that our method achieves accuracies of 92.8%, 84.9%, 81.5%, and 82.7%, respectively, outperforming state-of-the-art baselines.

Many complex systems like our society can be considered as the dependency among a series of events, where the event graph can properly depict the uncertainty by branches aggregating into or separating from event nodes. Consequently, targeting the decisive node in event graph as the plausible hypothesis to explain causality on occurrence between indirectly connected events (i.e.,event abductive reasoning) can facilitate evolutionary pattern mining. Previous works focused on extrapolating the best hypothesis based on observed associations between events. However, causal observations at higher causality levels that can provide additional causal information are still underutilized. To obtain more complete causal establishment on the whole event graph, we propose a more challenging task called the event graph-based abductive reasoning (EGAR), which may suffer fromnonmonotonicdefeasibility (i.e., seem to be correct may not necessarily be right), along with the chain-based transition problem due to the varying contexts between intermediary nodes. Therefore, we proposeBiCautionto resolve EGAR task and thoroughly mine thelatent causality in graph. Specifically, we model the abstract probabilistic graph as prototype, on which the pearl causal hierarchy (PCH) has been imposed across the causation ladder ofassociational,interventional, andcounterfactual. Thecore innovationofBiCautionlies in its “three-anchor, multijump” mechanism, which navigatesforward/backwardpaths by projecting event triples to different causality levels, and aggregating new observations on causal establishment into the representation of original triples to be scored. Benefiting from the above principle of in-graph multilayer observation on causal establishment, our proposedBiCautioncan not only outperform existing counterparts on graph-based event abductive reasoning in different graph sizes but can also resist different causality “error” characteristics, with the capacity to process long-chain event abductive reasoning.

In complex cooperative tasks, Multi-Agent Reinforcement Learning (MARL) faces the dual challenges of an exponentially growing joint action space and the constraints of partial observability. While the Centralized Training with Decentralized Execution (CTDE) paradigm is widely adopted, it often leads to homogeneous policies that lack the necessary specialization for complex teamwork. While role-based methods encourage specialization, they often lack mechanisms for inter-agent interaction. Consequently, the lack of rich information for role assignment means their roles may be assigned ineffectively, hindering the convergence of the team policy to its optimum. To address this critical gap, we propose ROIS, a novel framework that enhances multi-agent collaboration by grounding dynamic role assignments in a context-time-aware information sharing mechanism. Our key insight is to leverage a dedicated information sharing module that captures multi-step temporal context, providing each agent with richer, tailored feedback from its teammates. This mechanism directly addresses the lack of inter-agent interaction, leading to more accurate and effective role assignments. This results in a more coherent task division, which guides specialized policies toward the optimal joint policy and drastically reduces ineffective exploration. We conduct extensive experiments on the demanding StarCraft II, SMACv2, and Multi-agent Particle Environment benchmarks. The results demonstrate that ROIS consistently achieves state-of-the-art performance, significantly outperforming a wide range of advanced baselines, particularly in scenarios requiring deep coordination and policy adaptation. Finally, comprehensive ablation studies confirm the essential contribution of each component to the framework’s success.

With the rapid rise of short video social platforms, the spread of fake news videos has become a global challenge. Short videos, which integrate multiple modalities such as text, images, and audio, have a powerful visual and auditory impact, making fake news more prone to widespread dissemination and causing serious societal consequences. However, the complex fusion of multimodal information in fake news videos, coupled with editing artifacts that often blur the distinction between real and fake content, presents considerable challenges to traditional detection methods. To address these challenges, this paper proposes a fake news video detection method based on the Knowledge-Enhanced Dynamic Scene Graph Attention Network (KDSGAT). This method captures temporal correlations and local semantic differences in visual scenes by leveraging dynamic scene graph networks, while enhancing semantic understanding through knowledge distillation from external knowledge graphs. Specifically, we first use pre-trained models such as BERT, HuBERT, and Swin Transformer to extract text semantic features, audio emotion features, and visual features, respectively. Next, we apply an unbiased scene graph generation approach to convert keyframes from the video into scene graphs, which are then processed by the dynamic scene graph attention network to capture temporal correlations and local semantic variations within the scene graph sequences. Finally, co-attention is used to interactively fuse multimodal features, enabling precise detection of fake news in videos. We conduct extensive experiments on two real-world datasets from short video social platforms, FakeSV and FakeTT. The results show that our method outperforms state-of-the-art baselines, improving accuracy by 1.86% and 2.68% on the two datasets, respectively. The source code and data are available athttps://github.com/xuejianhuang/KDSGAT-FNVD.

Accurate prediction of crop yield is essential not only for sustainable agriculture but also for ensuring global food security. In recent times, deep learning (DL) techniques have made significant strides in improving prediction accuracy by leveraging complex and advanced architectures. However, despite these advancements, existing methods often struggle in modeling temporal dependencies efficiently, especially when dealing with limited data (a common challenge in crop yield prediction). To address this, an innovative iterative querying (IQ) strategy based on the principles of active learning (AL) to enhance model performance has been proposed. The aim of the IQ strategy is to maximize performance by introducing the model to a batch of uncertain instances in each iteration. The overall prediction framework consists of two key components: first, a Bayesian-optimized gated recurrent unit (GRU) method to capture the complex temporal relationships between crop variables and target yield; and second, the novel IQ strategy, which utilizes an uncertainty-driven query mechanism to refine predictions by focusing on the most challenging and uncertain data points. A comprehensive multisource data, comprising remotely sensed variables, climatic, soil, and corresponding crop yield values from the US Corn Belt region are used to train and evaluate the proposed IQ-GRU method. Experimental results demonstrate the effectiveness of the proposed IQ-GRU framework in improving yield estimation for both in-season and end-of-season predictions over conventional methods.

Multivariate time series forecasting has extensive applications in urban computing, such as financial analysis, weather prediction, and traffic forecasting. Using graph structures to model the complex correlations among variables in time series, and leveraging graph neural networks and recurrent neural networks for temporal aggregation and spatial propagation stage, has shown promise. However, traditional methods’ graph structure node learning and discrete neural architecture are not sensitive to issues such as sudden changes, time variance, and irregular sampling often found in real-world data. To address these challenges, we propose a method calledAdaptiveGraph structureLearning neuralRoughDifferentialEquations (AGLRDE). Specifically, we combine dynamic and static graph structure learning to adaptively generate a more robust graph representation. Then we employ a spatio-temporal encoder-decoder based on Neural Rough Differential Equations (Neural RDE) to model spatio-temporal dependencies. Additionally, we introduce a path reconstruction loss to constrain the path generation stage. We conduct experiments on six benchmark datasets, demonstrating that our proposed method outperforms existing state-of-the-art methods. The results show that AGLRDE effectively handles aforementioned challenges, significantly improving the accuracy of multivariate time series forecasting.

Detecting rumors on social networks is increasingly important due to their rapid dissemination and negative societal impact. The structural characteristics of propagation play a crucial role in rumor detection. However, most current graph neural network-based methods focus on spatial structural features, overlooking the temporal structural features or exploring spatio-temporal features from a single perspective, failing to comprehensively and finely learn representations of dynamic events. Therefore, this article proposes a multiview spatio-temporal feature learning method based on dual dynamic graph convolutional networks. First, dynamic graphs of information propagation and user interactions are constructed based on retweet and reply relationships. Second, BERT is utilized to extract semantic features of content, serving as initial node representations for the information propagation graph, while social features of users serve as initial node representations for the user interaction graph. Subsequently, dual graph convolutional networks are employed to learn representations of graph structures at different time steps. Finally, a time fusion unit based on cross-attention is devised to facilitate the learning and fusion of the spatio-temporal features from the two dynamic graphs. Experimental results on two real-world social network rumor datasets, PHEME and Weibo, demonstrate that our method outperforms all compared baseline methods and enables early detection of rumors.

Achieving joint goals efficiently in complex real-world tasks demands effective collaboration among multiple agents. Multi-Agent Reinforcement Learning (MARL) faces two interrelated challenges: limited exploration leads to early convergence on suboptimal behaviors, which in turn exacerbates non-stationarity under partial observability. To address these issues, we propose a novel framework, Spatio-Temporal Multi-agent Population Evolution (STPE-MARL). By integrating Evolutionary Algorithms (EAs) with MARL, our method enhances exploration diversity and facilitates global policy optimization. We further incorporate Graph Neural Networks (GNNs) to mitigate partial observability by encoding permutation symmetry through graph-based message passing. Two GNN-based training modes, Graph Relation and Graph Decomposition, are introduced to extend agents’ receptive fields and capture spatio-temporal dependencies through time-series trajectory sampling. We evaluate STPE-MARL in two complex environments: micromanagement tasks in StarCraft II and large-scale traffic simulations in SUMO (Simulation of Urban MObility). Experimental results demonstrate that STPE-MARL significantly improves policy convergence and outperforms baseline methods, highlighting the complementary roles of EAs in exploration and GNNs in addressing observation limitations.

Nowadays, detecting sentiment or emotion from user generated texts has been intensively studied in natural language understanding, especially via neural-based models based on text representation. However, the interpretability on how could the final text sentiment be determined by neural-based text representation has not been thoroughly unfolded yet. Consequently, in this paper, we proposeCogLignwhich injects theneural-cognitionderived from Electroencephalogram (EEG)-signal into theneural-basedtext sentiment analysis model, aimed at learning the activation of brain regions stimulated by different sentiments, so as to guide our proposedCogLignto make proper determination on text sentiment in brain-like way. Specifically, on the one hand, the given videos in different sentiments have been watched bysubjects, during which the EEG-signals are monitored to construct brain connectivity pattern asbrain graph(BG), attaining more obvious sentiment response on brain region activation forneural-cognition. On the other hand, we interpret the video-plots (or video-semantics) along timeline into text, where the entire video-interpreted-text will bestrictly boundwith the wholeEEG-signal-sequencebysegmentvia the fixed size oftime-window. Then, entities and relations are extracted from the video-interpreted-text to constructknowledge graph(KG), depicting text semantics. Next, mapping fromentities(or nodes) inKGtoEEG-Electrodes(or nodes) inBG, further dated back to different brain regions, has been learned viacognition alignmentbetween the EEG-derivedBGand text-derivedKG. In this way, by aligningneural cognitionfrombrain graphwith thesemantic cognitionfromknowledge graph, our proposed frameworkCogLigncan not only achieve the overall best sentiment analysis performance on thevideo-interpreted-text, but can also detect brain connectivity patterns in different sentiments more consistent with the prior conclusion of brain region sentiment preference, revealing competitiveinterpretabilityon text sentiment determination.

Coordinating multiple agents with diverse tasks and changing goals without interference is a challenge. Multi-Agent Reinforcement Learning (MARL) aims to develop effective communication and joint policies using group learning. Some of the previous approaches required each agent to maintain a set of networks independently, resulting in no consideration of interactions. Joint communication work causes agents receiving information unrelated to their own tasks. Currently, agents with different task divisions are often grouped by action tendency, but this can lead to poor dynamic grouping. This paper presents a two-phase solution for multiple agents, addressing these issues. The first phase develops heterogeneous agent communication joint policies using a Group Communication MARL framework (GCMA). The framework employs a periodic grouping strategy, reducing exploration and communication redundancy by dynamically assigning agent group hidden features through hyper-network and graph communication. The scheme efficiently utilizes resources for adapting to multiple similar tasks. In the second phase, each agent's policy network is distilled into a generalized simple network, adapting to similar tasks with varying quantities and sizes. GCMA is tested in complex environments like StarCraft II and UAV take-off, showing its well-performing for large-scale, coordinated tasks. It shows GCMA's effectiveness for solid generalization in multi-task tests with simulated pedestrians.

Heterogeneous multiagent systems are characterized by diverse task distributions, which are prevalent in practical scenarios, such as distributed decision making and robotic collaboration. A significant challenge in these systems is the constraint of limited observations, where each agent has access only to partial information. Many studies facilitate information exchange by employing shared parameters among agents. However, this approach is generally more effective for homogeneous systems where agents have similar observation or action spaces. In heterogeneous systems, indiscriminate parameter sharing can significantly increase the exploration cost required for effective adaptation. To address this challenge, we propose a novel communication complementary graph model (CCGM) for enhancing collaboration in heterogeneous multiagent systems. Our approach builds upon the training framework of heterogeneous agent reinforcement learning (HARL) with trust region learning and nonparameter sharing. This model utilizes advantage function decomposition and sequential updates to promote policy convergence. Within this framework, we introduce a novel communication method inspired by signaling games, where agents acting as receivers, process messages from other agents alongside their own observations. CCGM aligns the messages with observations in a graph-based communication module, which establishes communication relationships and supplements observational information. Subsequently, agents generate self-interested information, which they then share with others as senders. We evaluate our algorithm across various environments, including multiagent particle environments (MPE) and multiagent MuJoCo (MAMuJoCo) robot experiments. The results demonstrate the effectiveness of CCGM in enhancing HARL-based algorithms.

Object detection is a widely studied problem in existing works. However, in this paper, we turn to a more challenging problem of “ Covered Object Reasoning ”, aimed at reasoning the category label of target object in the given image particularly when it has been totally covered (or invisible ). To resolve this problem, we propose CoBjeason to seize the opportunity when visual reasoning meets the knowledge graph, where “ empirical cognition ” on common visual contexts have been incorporated as knowledge graph to conduct reinforced multi-hop reasoning via two collaborative agents. Such two agents, for one thing, stand at the covered object (or unknown entity ) to observe the surrounding visual cues in the given image and gradually select entities and relations from the global gallery-level knowledge graph which contains entity-pairs frequently occurring across the entire image-collection, so as to infer the main structure of image-level knowledge graph forward expanded from the unknown entity . In turn, for another, based on the reasoned image-level knowledge graph, the semantic context among entities will be aggregated backward into unknown entity to select an appropriate entity from the global gallery-level knowledge graph as the reasoning result. Moreover, such two agents will collaborate with each other, securing that the above Forward & Backward Reasoning will step towards the same destination of the higher performance on covered object reasoning. To our best knowledge, this is the first work on Covered Object Reasoning with Knowledge Graphs and reinforced Multi-Agent collaboration. Particularly, our study on Covered Object Reasoning and the proposed model CoBjeason could offer novel insights into more basic Computer Vision (CV) tasks, such as Semantic Segmentation with better understanding on the current scene when some objects are blurred or covered, Visual Question Answering with enhancement on the inference in more complicated visual context when some objects are covered or invisible, and Image Caption Generation with the augmentation on the richness of visual context for images containing partially visible objects. The improvement on the above basic CV tasks can further refine more complicated ones involved with nuanced visual interpretation like Autonomous Driving, where the recognition and reasoning on partially visible or covered object are critical. According to the experimental results, our proposed CoBjeason can achieve the best overall ranking performance on covered object reasoning compared with other models, meanwhile enjoying the advantage of lower “ exploration cost ”, with the insensitivity against the long-tail covered objects and the acceptable time complexity.

Online shopping has become a crucial way to encourage daily consumption, where the User-generated, or crowdsourced product comments, can offer a broad range of feedback on e-commerce products. As a result, integrating critical opinions or major attitudes from the crowdsourced comments can provide valuable feedback for marketing strategy adjustment or product-quality monitoring. Unfortunately, the scarcity of annotated ground truth on the integrated comment, or the limited gold integration reference, has incurred the infeasibility of the regular supervised-learning-based comment integration. To resolve this problem, in this article, inspired by the principle of Transfer Learning, we propose a three-stage transferable and generative crowdsourced comment integration framework ( TTGCIF ) based on zero-and-few-shot learning with the support of domain distribution alignment. The proposed framework aims at generating abstractive integrated comment in target domain via the enhanced neural text generation model, by referring the available integration resource in related source domains, to avoid the exhausted effort on resource annotation devoted to the target domain. Specifically, at the first stage, to enhance the domain transferability, representations on the crowdsourced comments have been aligned up between the source and target domain, by minimizing the domain distribution discrepancy in the kernel space. At the second stage, Zero-shot comment integration mechanism has been adopted to deal with the dilemma that none of the gold integration reference may be available in target domain. In other words, taking the sample-level semantic prototype as input, the enhanced neural text generation model in TTGCIF is trained to learn data semantic association among different domains via semantic prototype transduction, so that the “ unlabeled ” crowdsourced comments in target domain can be associated with existing integration references in related source domains. At the third stage, based on the parameters trained at the second stage, fast domain adaptation mechanism in a Few-shot manner has also been adopted by seeking most potential parameters along the gradient direction constrained by instances across multiple source domains. In this way, parameters in TTGCIF can be sensitive to any alteration on training data, ensuring that even if only few annotated resource in target domain are available for “Fine-tune,” TTGCIF can still react promptly to achieve effective target domain adaptation. According to the experimental results, TTGCIF can achieve the best transferable product comment integration performance in target domain, with fast and stable domain adaption effect depending on no more than 10% annotated resource in target domain. More importantly, even if TTGCIF has not been fine-tuned on the target domain, yet by referring to the available integration resource in related source domains, the integrated comments generated by TTGCIF on the target domain are still superior to those generated by models already fine-tuned on the target domain.

Nowadays, crowdsourced documents like Wikipedia pages and comments on products are all over the Internet. However, documents generated by crowdsourcing participants may contain inconsistent facts, implicit semantics and fabricated contents, thus threatening the trustworthiness of information content security available in Internet. To address this problem, we propose FuFaction, enabled by an enhanced observation mechanism based on the notion of hybrid-mask consisting of a hard-mask and a soft-mask, to eliminate factual inconsistencies on crowdsourced documents at the hidden-state level (or in a fuzzy way), according to the given evidence retrieved from an external open domain. Specifically, instead of focusing on a specific category of factual inconsistency, FuFaction captures anomalous hidden-states between a crowdsourced document and evidence obtained via a reverse-attention mechanism, where a hard-mask controls the attending direction as bidirectional and unidirectional for better understanding on semantics. Then, a soft-mask is generated with the help of the hard-masked reverse-attention to revise or mask anomalous hidden-states on the crowdsourced document. Afterwards, the masked hidden-states are further refined by a cross reverse-attention and factual consistency reinforcement strategy, based on which a new crowdsourced document with higher factual consistency is generated via neural text generation. According to our experimental results, FuFaction can effectively deal with the fuzzy factual inconsistencies on crowdsourced documents, achieving the overall best performance in terms of factual consistency metrics with a little higher (yet still competitive) editing cost on literal vocabulary, so as to reflect factually consistent semantics supported by the given evidence.

Crowdsourcing is a sourcing model where individuals or organizations obtain goods and services from a large, relatively open and often rapidly evolving group of internet users. The most common way that crowdsourcing can facilitate machine learning is to annotate instances with labels [1] . However, the same instance may have inconsistent class labels, in the eyes of various annotators. Therefore, current efforts in crowdsourcing mainly focus on the truth inference or label integration, to remove inconsistent labels or to alleviate biased labeling. In turn, instances with the integrated labels could facilitate the training on machine learning models. The future direction of crowdsourcing is to apply more fine-grained truth inference methods to different application domains [2] . Consequently, we evolve toward another challenging problem of comment integration. That is, how can we integrate or summarize the core opinions of multiple product comments obtained from users, rather than the discrete labels.

Building a human-computer conversational system that can communicate with humans is a research hotspot in the field of artificial intelligence. Traditional dialogue systems tend to produce irrelevant and non-information responses, which reduce people’s interest in engaging in a conversation. This often leads to boring conversations. To alleviate this problem, many researchers use external knowledge to assist conversation generation. The accuracy of knowledge selection is the prerequisite to ensure the quality of knowledge conversation. This approach has worked positively to a certain extent, but generally only searches knowledge information based on entity words themselves, without considering the specific conversation context. Therefore, if irrelevant knowledge is retrieved, the quality of conversation generation will be reduced. Motivated by this, we propose a novel neural knowledge-based conversation generation model, namedSiamese Network based Posterior Knowledge Selection Model for Knowledge Driven Conversation Generation (SPK-CG). We have designed a novel knowledge selection mechanism to obtain knowledge information that is highly relevant to the context of the conversation. Specifically, the posterior knowledge distribution is used as a soft label to make the prior distribution consistent with the posterior distribution in the training process. At the same time, in order to narrow the gap between prior and posterior distributions and improve the accuracy of knowledge selection, we leverage siamese network and design multi-granularity matching module for knowledge selection. Compared with previous knowledge-based models, our method can select more appropriate knowledge and use the selected knowledge to generate responses that are more relevant to the conversation context. Extensive automatic and human evaluations demonstrate that our model has advantages over previous baselines.

Source-free unsupervised domain adaptation (SFUDA) aims to accomplish the task of adaptation to the target domain by utilizing pre-trained source domain model and unlabeled target domain samples, without directly accessing any source domain data. Although many SFUDA works use the pseudo-labeling strategy to improve the accuracy of pseudo-labels in the target domain, these strategies ignore the influence of domain shift on calculating the reference distribution of pseudo-labels. In this article, we propose a novel kind of SFUDA with trusted pseudo samples (SFUDA-TPS), which uses reliable feature reference distribution to solve the SFUDA problem. In SFUDA-TPS, we design a target feature correcting classifier to alleviate the problem of feature reference distribution deviating from target domain samples distribution. On this basis, the more reliable feature reference distribution is calculated by selecting the target domain samples with a high amount of information, i.e., low entropy in the fixed source domain classifier and target feature correcting classifier. The implicit alignment between the source domain and target domain is realized by learning the source domain distributions hidden in the fixed source domain classifier. Experimental evaluations illustrate the effectiveness of our proposed method in solving SFUDA tasks.

Nowadays, mining opinions or sentiment from online user-generated text has become a research hot spot. Although a large amount of lexicon-based Chinese polarity detection works have been done, the existing methods have one common flaw: that even the same word can have opposite polarities among different seed lexicons. This is known as polarity fuzziness. To enhance the performance of Chinese sentiment polarity detection, we start from a two-aspect lexicon expansion so that the polarity fuzziness can be avoided. Specifically, we detect sentiment polarity for new words and revise sentiment polarity for words already defined in seed lexicons. Then, we formulate a novel sentiment polarity detection framework for Chinese (SPDFC) with more attention to fine-grained sentiment processing, which is involved in symmetrical mapping, sentiment feature pruning and text representation. In this way, words’ polarity can be directly taken as features, penetrating further in the polarity detection phase. According to our experimental results, the proposed SPDFC framework can achieve the best overall performance from the perspective of Chinese polarity detection, sentiment feature pruning, and text representation compared to other classical and state-of-the-art methods.

In the era of social networks, the rapid growth of data mining in information retrieval and natural language processing makes automatic text summarization necessary. Currently, pretrained word embedding and sequence to sequence models can be effectively adapted in social network summarization to extract significant information with strong encoding capability. However, how to tackle the long text dependence and utilize the latent topic mapping has become an increasingly crucial challenge for these models. In this article, we propose a topic-aware extractive and abstractive summarization model named T-BERTSum, based on Bidirectional Encoder Representations from Transformers (BERTs). This is an improvement over previous models, in which the proposed approach can simultaneously infer topics and generate summarization from social texts. First, the encoded latent topic representation, through the neural topic model (NTM), is matched with the embedded representation of BERT, to guide the generation with the topic. Second, the long-term dependencies are learned through the transformer network to jointly explore topic inference and text summarization in an end-to-end manner. Third, the long short-term memory (LSTM) network layers are stacked on the extractive model to capture sequence timing information, and the effective information is further filtered on the abstractive model through a gated network. In addition, a two-stage extractive–abstractive model is constructed to share the information. Compared with the previous work, the proposed model T-BERTSum focuses on pretrained external knowledge and topic mining to capture more accurate contextual representations. Experimental results on the CNN/Daily mail and XSum datasets demonstrate that our proposed model achieves new state-of-the-art results while generating consistent topics compared with the most advanced method.

Crowdsourcing is a hotspot research field which can facilitate machine learning by collecting labels to train models. Consequently, the state-of-the-art research efforts in crowdsourcing focus on truth inference or label integration, to remove inconsistent labels or to alleviate biased labeling. In turn, the integrated labels will be used to fine-tune machine learning models. Particularly, in this paper, we change the target of truth inference in crowdsourcing from discrete labels to multiple comments given by online participants, that is, the integration of the crowdsourced comments. For such a goal, we propose aSelf-play andSentiment-EmphasizedCommentIntegrationFramework (SSECIF), based on deepQ-learning, with three unique features. First, our framework SSECIF can generate the comment integration in a totally self-play way, without relying on the ground truth generated by human effort. Second, the integrated comment generated by SSECIF can include salient content with low redundancy. Third, the proposed framework SSECIF has emphasized, with a higher intensity, the sentiment in the integrated comment, in order to reflect the attitude or opinion more obviously. Extensive evaluation on real-world datasets demonstrates that SSECIF has achieved the best overall performance in terms of both effectiveness and efficiency, compared with the state-of-the-art methods.

Differential privacy can provide provable privacy security protection. In recent years, a great improvement has been made, however, in practical applications, the utility of original data is highly susceptible to noise, and thus, it limits its application and extension. To address the above problem, a new differential privacy method based on smooth sensitivity has been proposed in this paper. Using this method, the dataset's utility is improved greatly by reducing the amount of noise that is added, and this was validated by experiments.

The large-scale and complex structure of real networks brings enormous challenges to traditional community detection methods. In order to detect community structure in large-scale networks more accurately and efficiently, we propose a community detection algorithm based on the network embedding representation method. Firstly, in order to solve the scarce problem of network data, this paper uses the DeepWalk model to embed a high-dimensional network into low-dimensional space with topology information. Then, low-dimensional data are processed, with each node treated as a sample and each dimension of the node as a feature. Finally, samples are fed into a Gaussian mixture model (GMM), and in order to automatically learn the number of communities, variational inference is introduced into GMM. Experimental results on the DBLP dataset show that the model method of this paper can more effectively discover the communities in large-scale networks. By further analyzing the excavated community structure, the organizational characteristics within the community are better revealed.

The existing approaches to predict trust values in social commerce are based on personal social relationships without considering historical transaction information about products in social commerce, which results in false recommendations, and deceptions cannot be differentiated. Trust values extracted from social links can improve the performance of trust and reputation mechanism, but the rates from these links in social commerce can be false because of the stakeholders’ manipulation for personal interest. And the rates are also dynamic and inconsistent. Therefore, this paper proposes a comprehensive trust model by fully exploiting the effects of the transaction attributes and social relationships on users’ trust. The proposed model refines the granularity of trust evaluation and improves the discrimination of recommended information. Experiments demonstrate that the proposed model performs better and predicts more accurately than the three models compared under the same circumstance.

In this article, first a comprehensive study of the impact of term weighting schemes on the topic modeling performance (i.e., LDA and DMM) on Arabic long and short texts is presented. We investigate six term weighting methods including Word count method (standard topic models), TFIDF, PMI, BDC, CLPB, and CEW. Moreover, we propose a novel combination term weighting scheme, namely, CmTLB. We utilize the mTFIDF that takes into account the missing terms and the number of the documents in which the term appears when calculating the term weight. For further robust term weight, we combine mTFIDF with two weighting methods. We evaluate CmTLB against the studied weighting schemes by the quality of the learned topics (topic visualization and topic coherence), classification, and clustering tasks. We applied weighting schemes to Latent Dirichlet allocation (LDA) and Dirichlet multinomial mixture (DMM) on eight Arabic long and short document datasets, respectively. The experiment results outline that appropriate weighting schemes can effectively improve topic modeling performance on Arabic texts. More importantly, our proposed CmTLB significantly outperforms the other weighting schemes. Secondly, we investigate whether the Arabic stemming process can improve topic modeling performance. We study the three approaches of Arabic stemming including root-based, stem-based, and statistical approaches. We also train topic models with weighting schemes on documents after applying four stemmers related to different stemming approaches. The results outline that applying the stemming process not only reduces the dimensionality of term-document matrix leading to fast estimation process, but also show enhancement of topic modeling performance both on short and long Arabic documents. Moreover, Farasa stemmer achieves the highest performance in most cases, since it prevents the ambiguity that may happen because of the blind removal of the affixes such as in root-based or stem-based stemmers.

The increasing population of online communication and telecommunication has interested scholars and researchers considering their social networks. These social networks datasets play an exceptionally important role in the research of data mining. However, large amounts of social network data are pr oduced by using social networking applications. And these data inevitably contain a large amount of personal privacy information. Therefore, in order to avoid disclosure of privacy, the data holders need adopt privacy protection before these data are released. Furthermore, most current methods of privacy protection are based on the simple graph only. The weight values on the edges represent the tightness between the nodes. The algorithm based on weights in privacy protection field is still relatively rare. In real social networks, the weight can indicate tightness between two individuals of social relations. The weight may be as attackers’ background knowledge to re-identify the target individual and lead to loss of privacy. In this paper, we consider protecting the weighted social networks from weight-based attacks and propose a method based on the weighted social networks, named k-weighted generalization anonymity (KWGA). And This method combines k-anonymous with generalization method to ensure the security of the social network data when it is published. In order to ensure the higher validity of privacy protection, this paper introduces a concept of the weight difference to reduce the modification for weight graph. Finally, we firstly use real dataset C-DBLP to verify the validity of our method perform much better than the Fast k-degree anonymity (FKDA) in average clustering coefficient (ACC), global clustering coefficient (GCC), average path length (APL) and rate of edges change four aspects. Furthermore, we also use two common datasets in the research of weighted graphs to verify our algorithm.

As a combinatorial optimization problem, feature selection has been widely used in machine learning and data mining. In this paper, a feature selection method using forest optimization algorithm based on contribution degree is proposed. The proposed method uses a contribution degree strategy which is embedded in forest optimization algorithm. The goal of the contribution degree is to guide the search process of the forest optimization algorithm to select features according to high class correlation and low redundancy between features. The proposed algorithm is verified on some data sets from the UCI repository and the experiments show that the proposed method improves the classification accuracy compared with some other methods.

Summary Chinese Digital Bibliography & Library Project (C‐DBLP) is a huge and real‐life co‐author social network in China, rarely cited by published paper. It contains a large amount of ground‐truth community structure with distinguished research topics. Despite the fact that rich studies on community detection have been conducted with gains of practically fruitful algorithms, unfortunately, with the coming of ‘Big Data’ era and speedy development of mobile devices, social networks like C‐DBLP have incredibly expanded on nodes and edges, as a result, because of massive data cardinality, a large portion of community detection methods consume memory resource excessively. Therefore, in this work, we select Based on Structural Connection Hierarchical Exploration (BSCHE) algorithm to partition nodes in C‐DBLP because of its O(n) time cost, fast enough to process massive data, and its novel physical meaning of similarity between nodes defined by structural connection and availability. In addition, in order to avoid huge memory resource consumption caused by ‘Big Data’ of C‐DBLP, we strengthen BSCHE as a framework (BSCHEF) by our proposed ‘count‐pointer‐strategy’ imitated from incremental batch process to detect co‐author communities on C‐DBLP. The experiment results show that BSCHEF can find sets of communities onC‐DBLPmore effectively with the highest modularity value and the least execution time compared to other clustering algorithm. Copyright © 2015 John Wiley & Sons, Ltd.

Summary Today, the management of massive data collections draws much attention as data grids have been developed to deal with large computational problems and provide the opportunity for sharing geographically distributed resources for large‒scale data‒intensive applications. Therefore, finding an effective approach to discover data resources in order to promote better interactions between application communities or virtual organizations becomes a critical challenge. Traditional grid resource discovery models are mostly based on central and hierarchical architecture that can lead to bottlenecking with the expansion of the grid scale. Although the Peer‒to‒Peer (P2P) technique is integrated into the grid in order to improve the performance in recent years, each P2P structure still has drawbacks that require several compensatory strategies. In this paper, based on the unstructured super‒node‒based architecture from the P2P system, we design a structured logic resource tree in each domain in order to effectively alleviate the load on the super‒node, and we propose a query recording learning algorithm based on this hybrid architecture to reduce traffic in the network and greatly shorten the response time. The model and algorithm are validated by simulations and compared with the traditional super‒peer model and the flooding‒based approach. Copyright © 2014 John Wiley & Sons, Ltd.

The reconstruction of shredded documents has a great significance in the fields of forensics, reconstruction of historical documents, and intelligence analysis. The reconstruction of cross-cut shredded Chinese documents is presented in this paper. The Evaluation of Match Degree is divided into two sub-problems, feature and the corresponding scoring function. A new method of the Evaluation of Match Degree which is suitable for shredded Chinese documents is presented. Information Quantity is introduced to measure the reliability of each matching, instead of regarding as the same. A novel and effective algorithm of automatic reconstruction based on Information Quantity is put forward to control the serious propagation of errors caused by the matching of shreds with low Information Quantity. Not only is the propagation of errors controlled effectively, and the error ratio reduced, but also the time complexity decreases greatly. Experiments have proven the high accuracy and superiority of the algorithm proposed in this paper.

Context awareness is emphasized in order to provide automatic services in smart home. This paper uses case based reasoning as the reasoning method which solves the problem "in the first phase, we don't know exactly about the key processes and their interdependencies in smart home's context". The context's contents in smart home are described in this paper. Also, case representation, case storage and similarity calculation are discussed in smart home's context awareness. We propose a framework of context aware based on CBR, and discuss the case adaptation in detail.