Identifying the perceptive users for online social systems
PLoS ONEPublished 13 July 2017Open access
Jian-Guo Liu, Xiaolu Liu, Qiang Guo, Jingti Han
Citations6
SJR quartileQ1
SJR score0.80
SNIP1.07
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The perceptive user, who could identify the high-quality objects in their initial lifespan, is presented and a general framework for identifying the high perceptibility users based on user behavior patterns is presented.
Abstract
In this paper, the perceptive user, who could identify the high-quality objects in their initial lifespan, is presented. By tracking the ratings given to the rewarded objects, we present a method to identify the user perceptibility, which is defined as the capability that a user can identify these objects at their early lifespan. Moreover, we investigate the behavior patterns of the perceptive users from three dimensions: User activity, correlation characteristics of user rating series and user reputation. The experimental results for the empirical networks indicate that high perceptibility users show significantly different behavior patterns with the others: Having larger degree, stronger correlation of rating series and higher reputation. Furthermore, in view of the hysteresis in finding the rewarded objects, we present a general framework for identifying the high perceptibility users based on user behavior patterns. The experimental results show that this work is helpful for deeply understanding the collective behavior patterns for online users.
Keywords
Computer SciencePhysics and Astronomy
Machine LearningRandom Forests
126,192 Citations2001Leo Breiman
Internal estimates monitor error, strength, and correlation and these are used to show the response to increasing the number of features used in the forest, and are also applicable to regression.
Machine LearningSupport-vector networks
40,463 Citations1995Corinna Cortes, Vladimir Vapnik
High generalization ability of support-vector networks utilizing polynomial input transformations is demonstrated and the performance of the support- vector network is compared to various classical learning algorithms that all took part in a benchmark study of Optical Character Recognition.
ScienceEmergence of Scaling in Random Networks
36,366 Citations1999Albert-Ĺaszló Barabási, Réka Albert
A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
Machine LearningSupport-Vector Networks
33,035 Citations1995Corinna Cortes, Vladimir Vapnik
High generalization ability of support-vector networks utilizing polynomial input transformations is demonstrated and the performance of the support- vector network is compared to various classical learning algorithms that all took part in a benchmark study of Optical Character Recognition.
The Annals of StatisticsGreedy function approximation: A gradient boosting machine.
28,973 Citations2001Jerome H. Friedman
A general gradient descent boosting paradigm is developed for additive expansions based on any fitting criterion, and specific algorithms are presented for least-squares, least absolute deviation, and Huber-M loss functions for regression, and multiclass logistic likelihood for classification.
Neural Processing LettersLeast Squares Support Vector Machine Classifiers
9,375 Citations1999Johan A. K. Suykens, Joos Vandewalle
A least squares version for support vector machine (SVM) classifiers that follows from solving a set of linear equations, instead of quadratic programming for classical SVM's.
NatureExploring complex networks
8,339 Citations2001Steven H. Strogatz
This work aims to understand how an enormous network of interacting dynamical systems — be they neurons, power stations or lasers — will behave collectively, given their individual dynamics and coupling architecture.
NatureError and attack tolerance of complex networks
7,218 Citations2000Réka Albert, Hawoong Jeong +1 more
It is found that scale-free networks, which include the World-Wide Web, the Internet, social networks and cells, display an unexpected degree of robustness, the ability of their nodes to communicate being unaffected even by unrealistically high failure rates.
Computational Statistics & Data AnalysisStochastic gradient boosting
6,887 Citations2002Jerome H. Friedman
It is shown that both the approximation accuracy and execution speed of gradient boosting can be substantially improved by incorporating randomization into the procedure.
Physical Review LettersEpidemic Spreading in Scale-Free Networks
5,770 Citations2001Romualdo Pastor‐Satorras, Alessandro Vespignani
A dynamical model for the spreading of infections on scale-free networks is defined, finding the absence of an epidemic threshold and its associated critical behavior and this new epidemiological framework rationalizes data of computer viruses and could help in the understanding of other spreading phenomena on communication and social networks.
Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topicsMosaic organization of DNA nucleotides
5,023 Citations1994Chung‐Kang Peng, Sergey V. Buldyrev +4 more
This work analyzes two classes of controls consisting of patchy nucleotide sequences generated by different algorithms--one without and one with long-range power-law correlations, finding that both types of sequences are quantitatively distinguishable by an alternative fluctuation analysis method.
Chaos An Interdisciplinary Journal of Nonlinear ScienceQuantification of scaling exponents and crossover phenomena in nonstationary heartbeat time series
3,859 Citations1995Chung‐Kang Peng, Shlomo Havlin +2 more
A new method--detrended fluctuation analysis (DFA)--for quantifying this correlation property in non-stationary physiological time series is described and application of this technique shows evidence for a crossover phenomenon associated with a change in short and long-range scaling exponents.
Journal of the American Statistical AssociationBetter Bootstrap Confidence Intervals
3,243 Citations1987Bradley Efron
Nature PhysicsIdentification of influential spreaders in complex networks
3,193 Citations2010Maksim Kitsak, Lazaros K. Gallos +5 more
It is shown that the most influential spreaders in a social network do not correspond to the best connected people or to the most central people (high betweenness centrality), and the most efficient spreaders are those located within the core of the network as identified by the k-shell decomposition analysis.
Machine LearningGenetic Algorithms and Machine Learning
3,032 Citations1988David E. Goldberg, John H. Holland
BioinformaticsSupport vector machine classification and validation of cancer tissue samples using microarray expression data
2,471 Citations2000Terrence S. Furey, Nello Cristianini +4 more
A new method to analyse tissue samples using support vector machines for mis-labeled or questionable tissue results and shows that other machine learning methods also perform comparably to the SVM on many of those datasets.
NatureThe origin of bursts and heavy tails in human dynamics
2,285 Citations2005Albert-Ĺaszló Barabási
ScienceScale-Free Networks: A Decade and Beyond
2,129 Citations2009Albert-Ĺaszló Barabási
An avalanche of research has shown that many real networks, independent of their age, function, and scope, converge to similar architectures, a universality that allowed researchers from different disciplines to embrace network theory as a common paradigm.
NatureA universal model for mobility and migration patterns
1,510 Citations2012Filippo Simini, Marta C. González +2 more
A stochastic process capturing local mobility decisions that helps to derive commuting and mobility fluxes that require as input only information on the population distribution is introduced, significantly improving the predictive accuracy of most of the phenomena affected by mobility and transport processes.
Springer series in statisticsBootstrap Methods: Another Look at the Jackknife
1,258 Citations1992Bradley Efron
Proceedings of the National Academy of SciencesSolving the apparent diversity-accuracy dilemma of recommender systems
970 Citations2010Tao Zhou, Zoltán Kuscsik +4 more
This paper introduces a new algorithm specifically to address the challenge of diversity and shows how it can be used to resolve this apparent dilemma when combined in an elegant hybrid with an accuracy-focused algorithm.
Physical Review EDynamics of rumor spreading in complex networks
903 Citations2004Yamir Moreno, Maziar Nekovee +1 more
The mean-field equations characterizing the dynamics of a rumor process that takes place on top of complex heterogeneous networks are derived and the time profiles for several quantities are numerically computed, which allows us to distinguish among different variants of rumor spreading algorithms.
ScienceSocial Influence Bias: A Randomized Experiment
843 Citations2013Lev Muchnik, Sinan Aral +1 more
A large-scale randomized experiment on a social news aggregation Web site was designed and analyzed to investigate whether knowledge of such aggregates distorts decision-making, and found positive herding was topic-dependent and affected by whether individuals were viewing the opinions of friends or enemies.
Physical Review EModeling bursts and heavy tails in human dynamics
680 Citations2006Alexei Vázquez, J. G. Oliveira +4 more
It is shown that the bursty nature of human behavior is a consequence of a decision based queuing process: when individuals execute tasks based on some perceived priority, the timing of the tasks will be heavy tailed, most tasks being rapidly executed, while a few experiencing very long waiting times.
Scientific ReportsVirality Prediction and Community Structure in Social Networks
508 Citations2013Lilian Weng, Filippo Menczer +1 more
It is demonstrated that the future popularity of a meme can be predicted by quantifying its early spreading pattern in terms of community concentration, and the more communities a meme permeates, the more viral it is.
Proceedings of the National Academy of SciencesA Poissonian explanation for heavy tails in e-mail communication
409 Citations2008R. Dean Malmgren, Daniel B. Stouffer +2 more
It is demonstrated that the approximate power-law scaling of the inter-event time distribution is a consequence of circadian and weekly cycles of human activity, and a cascading nonhomogeneous Poisson process is proposed that explicitly integrates these periodic patterns in activity with an individual's tendency to continue participating in an activity.
NatureDarwin and Einstein correspondence patterns
359 Citations2005J. G. Oliveira, Albert-Ĺaszló Barabási
Darwin and Einstein's patterns of correspondence and today's electronic exchanges follow the same scaling laws, however, the response times of their surface-mail communication is described by a different scaling exponent from e- mail communication, providing evidence for a new class of phenomena in human dynamics.
Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topicsTopology of the conceptual network of language
302 Citations2002Adilson E. Motter, Alessandro P. S. de Moura +2 more
This work maps out the conceptual network of the English language, with the connections being defined by the entries in a Thesaurus dictionary, and finds that this network presents a small-world structure, and appears to exhibit an asymptotic scale-free feature with algebraic connectivity distribution.
Proceedings of the National Academy of SciencesEvidence for a bimodal distribution in human communication
272 Citations2010Ye Wu, Changsong Zhou +3 more
This work presents clear empirical evidence from Short Message correspondence that observed human actions are the result of the interplay of three basic ingredients: Poisson initiation of tasks and decision making for task execution in individual humans as well as interaction among individuals.
Proceedings of the National Academy of SciencesScaling laws of human interaction activity
250 Citations2009Diego Rybski, Sergey V. Buldyrev +3 more
This research identifies a generalized version of Gibrat's law of social activity expressed as a scaling law between the fluctuations in the number of messages sent by members and their level of activity and attributes this scaling law to long-term correlation patterns in human activity.
The Annals of StatisticsBootstrap of the Mean in the Infinite Variance Case
229 Citations1987Krishna B. Athreya
CERN Document Server (European Organization for Nuclear Research)Human Dynamics: The Correspondence Patterns of Darwin and Einstein
222 Citations2005J. G. Oliveira, Albert-Ĺaszló Barabási
Scientific ReportsLocating influential nodes via dynamics-sensitive centrality
156 Citations2016Jian-Guo Liu, Jianhong Lin +2 more
A dynamics-sensitive (DS) centrality is presented by integrating topological features and dynamical properties and is more accurate than degree, k-shell index and eigenvector centrality.
Physical Review LettersExact Results for the Barabási Model of Human Dynamics
140 Citations2005Alexei Vázquez
It is demonstrated that the Barabási model has a singular behavior in the extremal dynamics limit, when the highest priority task is selected first, and the average waiting time is smaller or equal to the number of active tasks.
Physical Review EInformation filtering via biased heat conduction
122 Citations2011Jian-Guo Liu, Tao Zhou +1 more
It is suggested that the present algorithm could simultaneously identify users' mainstream and special tastes, resulting in better performance than the standard heat conduction algorithm, which provides a creditable way for highly efficient information filtering.
CERN Document Server (European Organization for Nuclear Research)Information filtering via Iterative Refinement
103 Citations2006Laureti, Paolo, Moret, Lionel +2 more
Europhysics Letters (EPL)Information filtering via Iterative Refinement
103 Citations2006P Laureti, L Moret +2 more
A new ranking method is analyzed, where the reputation of information providers is determined self-consistently and is found to be more relevant than previous methods.
New Journal of PhysicsModeling human dynamics with adaptive interest
99 Citations2008Xiao-Pu Han, Tao Zhou +1 more
An interest-based model is proposed that indicates a power-law inter-event time distribution with exponent −1, which is in accordance with some empirical observations in human-initiated systems.
Physical Review EError and attack tolerance of layered complex networks
91 Citations2007Maciej Kurant, Patrick Thiran +1 more
This paper studies the robustness of five examples of two-layer complex systems, and finds that multi-layer systems are much more vulnerable to errors and intentional attacks than they appear from a single layer perspective.
reroDoc Digital LibraryA robust ranking algorithm to spamming
85 Citations2011Yanbo Zhou, Ting Lei +1 more
Scientific ReportsEmergence of scaling in human-interest dynamics
83 Citations2013Zhi-Dan Zhao, Zimo Yang +4 more
This study represents the first attempt to understand the dynamical processes underlying human interest, which has significant applications in science and engineering, commerce, as well as defense, in terms of specific tasks such as recommendation and human-behavior prediction.
Scientific ReportsCommunication activity in a social network: relation between long-term correlations and inter-event clustering
82 Citations2012Diego Rybski, Sergey V. Buldyrev +3 more
The activity of the whole community presents long-term correlations that are a true emergent property of the system, i.e. they are not related to the distribution of inter-event times, which suggests the existence of collective behavior.
Europhysics Letters (EPL)A robust ranking algorithm to spamming
71 Citations2011Yan-Bo Zhou, Ting Lei +1 more
A correlation-based reputation algorithm is proposed to solve the ranking problem of web-based rating systems where user votes some objects with ratings and shows a higher robustness against spammer attack.
PLoS ONEExtracting the Information Backbone in Online System
61 Citations2013Qian-Ming Zhang, An Zeng +1 more
This paper designs some algorithms to improve the recommendation performance by eliminating some links from the original networks and proposes a hybrid method combining the time-aware and topology-aware link removal algorithms to extract the backbone which contains the essential information for the recommender systems.
PLoS ONERanking Reputation and Quality in Online Rating Systems
60 Citations2014Hao Liao, An Zeng +4 more
This paper designs an iterative ranking method with high performance in both accuracy and robustness, and introduces a reputation redistribution process to enhance the influence of highly reputed users and two penalty factors enable the algorithm resistance to malicious behaviors.
Scientific ReportsStability of similarity measurements for bipartite networks
57 Citations2016Jian-Guo Liu, Lei Hou +3 more
A top-n-stability method for personalized recommendation is developed and it is found that the unstable similarities would recommend false information to users and the performance of recommendation would be largely improved by using stable similarity measurements.
Scientific ReportsMemory effect of the online user preference
50 Citations2014Lei Hou, Xue Pan +2 more
A preference model is presented in which a Markovian process is utilized to describe the users' selecting behavior and the rating behavior depends on the selecting behavior, which could regenerate any duration distribution ranging from the power-law form (strong memory) to the exponential form (weak memory).
Europhysics Letters (EPL)Group-based ranking method for online rating systems with spamming attacks
50 Citations2015Jian Gao, Yu-Wei Dong +3 more
A group-based ranking method that evaluates users' reputations based on their grouping behaviors, which indicates that the present method is more accurate and robust than the correlation-based method in the presence of spamming attacks.
Europhysics Letters (EPL)Anchoring bias in online voting
42 Citations2012Zimo Yang, Zi‐Ke Zhang +1 more
A systematic bias embedding in the individual decision-making processes is revealed, namely people tend to give a low ratings after a low rating, as well as a high rating following a high ratings.
Physica A Statistical Mechanics and its ApplicationsIdentifying online user reputation of user–object bipartite networks
37 Citations2016Xiaolu Liu, Jian-Guo Liu +3 more
A parameter-free algorithm is presented, where the user reputation is calculated based on the probability that their ratings are consistent with the main part of all user opinions, which suggests that the presented algorithm is very effective and efficient for the large scale dynamic online systems.
Physica A Statistical Mechanics and its ApplicationsRanking online quality and reputation via the user activity
33 Citations2015Xiaolu Liu, Qiang Guo +3 more
This paper presents an improved iterative algorithm for online ranking object quality and user reputation in terms of the user degree (IRUA), where the user’s reputation is measured by his/her rating vector, the corresponding objects’ quality vector and theuser degree.
Europhysics Letters (EPL)The effect of discrete vs. continuous-valued ratings on reputation and ranking systems
25 Citations2010Matúš Medo, Joseph Rushton Wakeling
A comparative test of several co-determination algorithms with different scales of discrete ratings is performed and it is shown that increased noise in users' ratings may even improve the overall performance of the system.
Physica A Statistical Mechanics and its ApplicationsCeiling effect of online user interests for the movies
22 Citations2014Jing Ni, Yilu Zhang +5 more
The information entropy is introduced to measure the diversity of the user interests and shows that as the user degree increases, the entropy increases from the lowest value at first to the highest value and then begins to fall, which indicates that the interests of the small-degree and large-degree users are more centralized, while the interests are more diverse.
PLoS ONEIdentifying the Role of Common Interests in Online User Trust Formation
18 Citations2015Lei Ji, Jian-Guo Liu +2 more
The empirical results show that the taste similarity θ is rapidly increased around the day when users trust the others, which suggests that the similar tastes on the common interests among users lead to the trust formation.
Physica A Statistical Mechanics and its ApplicationsMemory effect of the online rating for movies
16 Citations2014Yilu Zhang, Qiang Guo +2 more
This paper investigates the correlations between the users’ rating behaviors and the real-time updated average ratings of objects given from other users' previous ratings and shows that in general there is a linear correlation with slope one between them when the displayed average ratings are between 2.0 and 4.5.