Purpose: As a new communication paradigm, social networking sites (SNS) have boosted information diffusion and viral marketing. Prior researchers have identified various factors affecting information dissemination on SNS. However, they often focus on limited factors and there is a lack of an integrated theoretical framework that explains aspects of relevant factors. Besides, the research on the impacts of relationships on individual retweeting behavior is still controversial. The purpose of this paper is to propose a theoretical framework to systematically investigate the determinants of individual dissemination behavior on SNS based on the elaboration likelihood model (ELM). Moreover, the authors also examine the relative importance of those relevant factors.Design/methodology/approach: The authors randomly selected 1,250 members of Twitter and crawled posts published by each member since he/she created the Twitter account using Twitter API. The authors processed the data to create panel data and tested hypotheses with the panel logit model.Findings: Factors both on the central route and on the peripheral route of ELM have positive impacts on individual dissemination behavior. Among them, information receiver-related factor and relationships-related factors are the most influential. Contrastingly, source-related factors are the least influential. Furthermore, the authors find that social tie strength mediates almost 50 percent of the effect of value homophily on individual dissemination behavior.Originality/value: The authors are the first to directly apply ELM to examine individual dissemination behavior on SNS. By integrating factors into the two information processing routes, They incorporate relevant factors into the model and systematically analyze their impacts on individual retweeting behavior on SNS. The research offers at least one explanation for the contradictory findings about the effect of homophily on individual sharing behavior in previous research. The authors propose new variables that gauge topical relevance and interpersonal value homophily on SNS.
29 June 2017 in Information Technology and Management
Feature selection, also known as attribute selection, is the technique of selecting a subset of relevant features for building robust object models. It is becoming more and more important for large-scale sensors applications with AI capabilities. The core idea of this paper is derived from a straightforward and intuitive principle saying that, if a feature subset (pattern) has more representativeness, it should be more self-organized, and as a result it should be more insensitive to artificially seeded noise points. In the light of this heuristic finding, we established the whole set of theoretical principles, based on which we proposed a two-stage framework to evaluate the relative importance of feature subsets, called seeding and harvest (S&H for short). At the first stage, we inject a number of artificial noise points into the original dataset; then at the second stage, we resort to an outlier detector to identify them under various feature patterns. The more precisely the seeded points can be extracted under a particular feature pattern, the more valuable and important the corresponding feature pattern should be. Besides, we compared our method with several state-of-the-art feature selection methods on a number of real-life datasets. The experiment results significantly confirm that our method can accomplish feature reduction tasks with high accuracy as well as low computing complexity.
12 December 2011 in Transactions of the Institute of Measurement and Control
Outlier detection plays an important role in intelligent cyber systems, especially for fault-tolerant and adaptive ones. Traditional algorithms always need to evaluate distances or densities, which are very time-consuming. Considering the increasingly urgent demand for real-time application, during the past few years, various novel algorithms have been proposed. They are much faster, but less stable and less accurate. To cope with these problems, based on the core idea of ordinal optimization and the ‘few and different’ characteristics of outliers, by introducing the concept of outlier probability, we propose this ordinal outlier detection algorithm (OOD), which extracts outliers in terms of the order of being isolated in a recursive uniform data space partitioning process. It does not need any distance or density evaluation, and the complexity is reduced to O(n). Experiments show that the CPU time of OOD increases linearly with linearly growing data sets. Furthermore, compared with the recent iForest algorithm, OOD is about 30 times faster, with a 20–30% improvement in accuracy and in particular is much more stable. OOD also has good scalability, so it works well in high-dimensional data sets, which have a huge number of instances and irrelevant attributes.