In this paper I present and defend a definition of vagueness, and draw out some consequences of accepting this definition. §1 asks what we should properly expect of a definition of vagueness, and §2 reviews existing definitions. §3 explains a key background notion necessary to an understanding of the definition to be presented here. §4 presents this definition, and §5 explains its advantages. §...

Closeness measures are crucial to clustering methods. In most traditional clustering methods, the closeness between data points or clusters is measured by the geometric distance alone. These metrics quantify the closeness only based on the concerned data points' positions in the feature space, and they might cause problems when dealing with clustering tasks having arbitrary clusters shapes and ...

The present study examined how the network science measure known as closeness centrality (which measures the average distance between a node and all other nodes in the network) influences lexical processing. In the mental lexicon, a word such as CAN has high closeness centrality, because it is close to many other words in the lexicon. Whereas, a word such as CURE has low closeness centrality be...

Identifying influential nodes in complex networks has received increasing attention for its great theoretical and practical applications in many fields. Some classical methods, such as degree centrality, betweenness centrality, closeness centrality, and coreness centrality, were reported to have some limitations in detecting influential nodes. Recently, the famous h-index was introduced to the ...

We consider variations of two well-known centrality measures, betweenness and closeness, with a different model of information spread. Rather than along shortest paths only, it is assumed that information spreads efficiently like an electrical current. We prove that the current-flow variant of closeness centrality is identical with another known measure, information centrality, and give improve...

Identifying the node spreading influence in networks is an important task to optimally use the network structure and ensure the more efficient spreading in information. In this paper, by taking into account the shortest distance between a target node and the node set with the highest k-core value, we present an improved method to generate the ranking list to evaluate the node spreading influenc...