4 research outputs found
Network ontology of tourism domain
It is known that actor-network approach proposed by B. Latura et. al. describes in an identical manner material and semiotic relations, i.e. relations between subjects and objects, and concepts, and in these connections is subject to serious criticism and, therefore, is highly controversial. In contrast, complex networks elicited by A. Barabashi's works as a starting position for a modern understanding of complex dynamic objects with a huge number of actors allow and assume diverse stratification, and demonstrate their topological specificity. The work deals with multidisciplinary ontology, which combines actor-network approach and complex network platform, as a perspective for effective management within the tourist industry of regional scale
Searching for network modules
When analyzing complex networks a key target is to uncover their modular
structure, which means searching for a family of modules, namely node subsets
spanning each a subnetwork more densely connected than the average. This work
proposes a novel type of objective function for graph clustering, in the form
of a multilinear polynomial whose coefficients are determined by network
topology. It may be thought of as a potential function, to be maximized, taking
its values on fuzzy clusterings or families of fuzzy subsets of nodes over
which every node distributes a unit membership. When suitably parametrized,
this potential is shown to attain its maximum when every node concentrates its
all unit membership on some module. The output thus is a partition, while the
original discrete optimization problem is turned into a continuous version
allowing to conceive alternative search strategies. The instance of the problem
being a pseudo-Boolean function assigning real-valued cluster scores to node
subsets, modularity maximization is employed to exemplify a so-called quadratic
form, in that the scores of singletons and pairs also fully determine the
scores of larger clusters, while the resulting multilinear polynomial potential
function has degree 2. After considering further quadratic instances, different
from modularity and obtained by interpreting network topology in alternative
manners, a greedy local-search strategy for the continuous framework is
analytically compared with an existing greedy agglomerative procedure for the
discrete case. Overlapping is finally discussed in terms of multiple runs, i.e.
several local searches with different initializations.Comment: 10 page
ΠΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΎΠ½Π½ΡΠ΅ ΡΠ΅Ρ Π½ΠΎΠ»ΠΎΠ³ΠΈΠΈ Π² Π½Π°ΡΠΊΠ΅, ΡΠΏΡΠ°Π²Π»Π΅Π½ΠΈΠΈ, ΡΠΎΡΠΈΠ°Π»ΡΠ½ΠΎΠΉ ΡΡΠ΅ΡΠ΅ ΠΈ ΠΌΠ΅Π΄ΠΈΡΠΈΠ½Π΅. Π§. 2
Π‘Π±ΠΎΡΠ½ΠΈΠΊ ΠΏΠΎΡΠ²ΡΡΡΠ½ ΡΠ΅ΠΎΡΠ΅ΡΠΈΡΠ΅ΡΠΊΠΈΠΌ ΠΈ ΠΏΡΠ°ΠΊΡΠΈΡΠ΅ΡΠΊΠΈΠΌ Π°ΡΠΏΠ΅ΠΊΡΠ°ΠΌ ΡΠ°Π·ΡΠ°Π±ΠΎΡΠΊΠΈ ΠΈ ΠΏΡΠΈΠΌΠ΅Π½Π΅Π½ΠΈΡ ΡΠΎΠ²ΡΠ΅ΠΌΠ΅Π½Π½ΡΡ
ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΎΠ½Π½ΡΡ
ΡΠ΅Ρ
Π½ΠΎΠ»ΠΎΠ³ΠΈΠΉ. ΠΡΠΎΠ±ΠΎΠ΅ Π²Π½ΠΈΠΌΠ°Π½ΠΈΠ΅ ΡΠ΄Π΅Π»Π΅Π½ΠΎ Π²ΠΎΠΏΡΠΎΡΠ°ΠΌ ΠΌΠ°ΡΠ΅ΠΌΠ°ΡΠΈΡΠ΅ΡΠΊΠΎΠ³ΠΎ ΠΌΠΎΠ΄Π΅Π»ΠΈΡΠΎΠ²Π°Π½ΠΈΡ ΠΈ ΠΏΡΠΈΠΌΠ΅Π½Π΅Π½ΠΈΡ ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΎΠ½Π½ΡΡ
ΡΠ΅Ρ
Π½ΠΎΠ»ΠΎΠ³ΠΈΠΉ Π² ΡΠ°Π·Π»ΠΈΡΠ½ΡΡ
ΠΏΡΠ΅Π΄ΠΌΠ΅ΡΠ½ΡΡ
ΠΎΠ±Π»Π°ΡΡΡΡ
. Π ΡΠ±ΠΎΡΠ½ΠΈΠΊΠ΅ ΠΏΡΠ΅Π΄ΡΡΠ°Π²Π»Π΅Π½ ΡΠΈΡΠΎΠΊΠΈΠΉ ΠΊΡΡΠ³ ΠΈΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½ΠΈΠΉ ΡΠΎΡΡΠΈΠΉΡΠΊΠΈΡ
ΠΈ Π·Π°ΡΡΠ±Π΅ΠΆΠ½ΡΡ
ΡΡΡΠ½ΡΡ
, ΠΏΡΠ΅ΠΏΠΎΠ΄Π°Π²Π°ΡΠ΅Π»Π΅ΠΉ, Π°ΡΠΏΠΈΡΠ°Π½ΡΠΎΠ² ΠΈ ΡΡΡΠ΄Π΅Π½ΡΠΎΠ², ΠΏΡΠ΅Π΄ΡΡΠ°Π²Π»Π΅Π½Π½ΡΡ
Π½Π° IV ΠΠ΅ΠΆΠ΄ΡΠ½Π°ΡΠΎΠ΄Π½ΠΎΠΉ ΠΊΠΎΠ½ΡΠ΅ΡΠ΅Π½ΡΠΈΠΈ Β«ΠΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΎΠ½Π½ΡΠ΅ ΡΠ΅Ρ
Π½ΠΎΠ»ΠΎΠ³ΠΈΠΈ Π² Π½Π°ΡΠΊΠ΅, ΡΠΏΡΠ°Π²Π»Π΅Π½ΠΈΠΈ, ΡΠΎΡΠΈΠ°Π»ΡΠ½ΠΎΠΉ ΡΡΠ΅ΡΠ΅ ΠΈ ΠΌΠ΅Π΄ΠΈΡΠΈΠ½Π΅Β», ΠΏΡΠΎΡΠ΅Π΄ΡΠ΅ΠΉ Π² Π³. Π’ΠΎΠΌΡΠΊΠ΅ Π½Π° Π±Π°Π·Π΅ Π’ΠΎΠΌΡΠΊΠΎΠ³ΠΎ ΡΠ½ΠΈΠ²Π΅ΡΡΠΈΡΠ΅ΡΠ° ΡΠΈΡΡΠ΅ΠΌ ΡΠΏΡΠ°Π²Π»Π΅Π½ΠΈΡ ΠΈ ΡΠ°Π΄ΠΈΠΎΡΠ»Π΅ΠΊΡΡΠΎΠ½ΠΈΠΊΠΈ ΠΈ Π’ΠΎΠΌΡΠΊΠΎΠ³ΠΎ ΠΏΠΎΠ»ΠΈΡΠ΅Ρ
Π½ΠΈΡΠ΅ΡΠΊΠΎΠ³ΠΎ ΡΠ½ΠΈΠ²Π΅ΡΡΠΈΡΠ΅ΡΠ°