نتایج جستجو برای: closeness similarity
تعداد نتایج: 112659 فیلتر نتایج به سال:
This paper implements an estimated ranking algorithm of closeness centrality measures in large-scale workflow-supported social networks. The traditional ranking algorithms for large-scale networks have suffered from the time complexity problem. The larger the network size is, the bigger dramatically the computation time becomes. To solve the problem on calculating ranks of closeness centrality ...
In this article I examine whether turnout in the 2000 presidential election was influenced by closeness and candidate expenditures. Evidence that closeness affects turnout supports the theory that voters assign more weight to their votes in close elections. Evidence that expenditures increase turnout provides support for the argument that greater mobilization efforts increase turnout in close e...
We introduce H -group closeness centrality in this work. H -group closeness centrality of a group of nodes measures how close this node group is to other nodes in a graph, and can be used in numerous applications such as measuring the importance and influence of a group of users in a social network. When a large graph contains billions of edges that cannot reside entirely in a computer’s main m...
One prediction of the calculus of voting is that electoral closeness positively affects turnout via a higher probability of one vote being decisive. I test this theory with data on all mayoral elections in the German state of Bavaria between 1946 and 2009. Importantly, I use constitutionally prescribed two-round elections to measure electoral closeness and thereby improve on existing work that ...
k-Anonymity and ε-differential privacy are two mainstream privacy models, the former introduced to anonymize data sets and the latter to limit the knowledge gain that results from the inclusion of one individual in the data set. Whereas basic k-anonymity only protects against identity disclosure, t-closeness was presented as an extension of k-anonymity that also protects against attribute discl...
This study examined late adolescents' self-defining memories about relationships. Participants were 88 European Americans (mean age = 19 years) who reported 3 self-defining memories of their choosing and were selected for the study because they reported a memory about parents and/or peers. Memory narratives were coded for themes of separation, closeness, and conflict and for 2 kinds of meaning:...
Personal goals, that is, ideas of what one wants to maintain, attain, or avoid in the future, are pursued within social contexts and may influence the social systems a person belongs to. Focusing on romantic partnerships as one of the most important social contexts in adulthood, this longitudinal study investigated the role of partners' mutual goal knowledge for partnership development (T1: N=6...
t-Closeness is a privacy model recently defined for data anonymization. A data set is said to satisfy t-closeness if, for each group of records sharing a combination of key attributes, the distance between the distribution of a confidential attribute in the group and the distribution of the attribute in the data is no more than a threshold t. We state here the t-closeness property in terms of i...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید