6,025 research outputs found
Easing Embedding Learning by Comprehensive Transcription of Heterogeneous Information Networks
Heterogeneous information networks (HINs) are ubiquitous in real-world
applications. In the meantime, network embedding has emerged as a convenient
tool to mine and learn from networked data. As a result, it is of interest to
develop HIN embedding methods. However, the heterogeneity in HINs introduces
not only rich information but also potentially incompatible semantics, which
poses special challenges to embedding learning in HINs. With the intention to
preserve the rich yet potentially incompatible information in HIN embedding, we
propose to study the problem of comprehensive transcription of heterogeneous
information networks. The comprehensive transcription of HINs also provides an
easy-to-use approach to unleash the power of HINs, since it requires no
additional supervision, expertise, or feature engineering. To cope with the
challenges in the comprehensive transcription of HINs, we propose the HEER
algorithm, which embeds HINs via edge representations that are further coupled
with properly-learned heterogeneous metrics. To corroborate the efficacy of
HEER, we conducted experiments on two large-scale real-words datasets with an
edge reconstruction task and multiple case studies. Experiment results
demonstrate the effectiveness of the proposed HEER model and the utility of
edge representations and heterogeneous metrics. The code and data are available
at https://github.com/GentleZhu/HEER.Comment: 10 pages. In Proceedings of the 24th ACM SIGKDD International
Conference on Knowledge Discovery and Data Mining, London, United Kingdom,
ACM, 201
Harmonization of modeling systems for assessing the electric-power consumption levels at mining enterprises
Purpose. The purpose of the work is to study the system corporate features of electric-power consumption systems, the formation of applied scientific and methodological support, as well as economic and mathematical modeling tools to analyse the cost characteristics of the electric-power consumption.
Methods. The research is based on the use of laws, patterns and categorical set. In the course of scientific research, the general scientific methods were used (comparison, generalization, analogue method, structural analysis and synthesis), methods of logical-theoretical analysis and special economic-mathematical methods. The official documents that reflect and regulate certain aspects of the power consumption system in the acquisition, processing and presentation of information were the normative basis of research. The materials of scientific conferences and seminars, the resources of the global Internet information system, the information from the State Statistics Service of Ukraine were used as information sources. The theoretical basis of research is confirmed by scientific works of domestic and foreign researchers in the field of power supply in a transition economy. The complex of regression and index methods, as well as models of electric-power consumption analysis are used to determine the transformational changes in the components of electric-power consumption.
Findings. The parameters have been analysed of electric-power consumption in iron-ore enterprises of the Kryvyi Rih region. The process has been investigated of forming a system of models for solving the problem of the cost characteristics optimization of electric-power consumption. The system corporate features have been determined of the power consumption systems in iron-ore enterprises of the Kryvyi Rih region. The tools set has been formed of economic and mathematical modelling in order to analyse and assess the cost indicators of power consumption systems. The harmonization of modelling methods made it possible to determine the cost characteristics and prove the rationality of using the models, calculate the effective resources assignment, and make recommendations in accordance with rational management decisions on the formation of electric-power consumption.
Originality. An innovative integrated approach to the formation of corporate models of electric-power supply systems has been proposed, which uses the index methodology in combination with the least modules methods. This approach allows to optimize electric-power costs and ensure rational management of electric-power consumption.
Practical implications. The formation of corporate models is the basis for further research and the construction of multifactorial regression models, as well as models to predict the electric-power consumption. Practical experience in the use of the proposed methodology has proven its effectiveness in making management decisions to ensure optimal electric-power consumption characteristics.ΠΠ΅ΡΠ°. ΠΠΈΠ²ΡΠ΅Π½Π½Ρ ΡΠΈΡΡΠ΅ΠΌΠ½ΠΈΡ
ΠΊΠΎΡΠΏΠΎΡΠ°ΡΠΈΠ²Π½ΠΈΡ
Ρ
Π°ΡΠ°ΠΊΡΠ΅ΡΠΈΡΡΠΈΠΊ ΡΠΈΡΡΠ΅ΠΌ Π΅Π»Π΅ΠΊΡΡΠΎΡΠΏΠΎΠΆΠΈΠ²Π°Π½Π½Ρ, ΡΠΎΡΠΌΡΠ²Π°Π½Π½Ρ ΠΏΡΠΈΠΊΠ»Π°Π΄Π½ΠΎΠ³ΠΎ Π½Π°ΡΠΊΠΎΠ²ΠΎ-ΠΌΠ΅ΡΠΎΠ΄ΠΈΡΠ½ΠΎΠ³ΠΎ Π·Π°Π±Π΅Π·ΠΏΠ΅ΡΠ΅Π½Π½Ρ ΡΠ° ΡΠ½ΡΡΡΡΠΌΠ΅Π½ΡΠΈ Π΅ΠΊΠΎΠ½ΠΎΠΌΡΠΊΠΎ-ΠΌΠ°ΡΠ΅ΠΌΠ°ΡΠΈΡΠ½ΠΎΠ³ΠΎ ΠΌΠΎΠ΄Π΅Π»ΡΠ²Π°Π½Π½Ρ Π· ΠΌΠ΅ΡΠΎΡ Π°Π½Π°Π»ΡΠ·Ρ ΠΉ Π²Π°ΡΡΡΡΠ½ΠΈΡ
Ρ
Π°ΡΠ°ΠΊΡΠ΅ΡΠΈΡΡΠΈΠΊ Π΅Π»Π΅ΠΊΡΡΠΎΡΠΏΠΎΠΆΠΈΠ²Π°Π½Π½Ρ.
ΠΠ΅ΡΠΎΠ΄ΠΈΠΊΠ°. ΠΠΎΡΠ»ΡΠ΄ΠΆΠ΅Π½Π½Ρ Π·Π°ΡΠ½ΠΎΠ²Π°Π½Π΅ Π½Π° Π²ΠΈΠΊΠΎΡΠΈΡΡΠ°Π½Π½Ρ Π·Π°ΠΊΠΎΠ½ΡΠ², Π·Π°ΠΊΠΎΠ½ΠΎΠΌΡΡΠ½ΠΎΡΡΠ΅ΠΉ ΡΠ° ΠΊΠ°ΡΠ΅Π³ΠΎΡΠΈΡΠ½ΠΎΠ³ΠΎ Π°ΠΏΠ°ΡΠ°ΡΡ. Π£ ΠΏΡΠΎΡΠ΅ΡΡ Π½Π°ΡΠΊΠΎΠ²ΠΈΡ
Π΄ΠΎΡΠ»ΡΠ΄ΠΆΠ΅Π½Ρ Π±ΡΠ»ΠΈ Π²ΠΈΠΊΠΎΡΠΈΡΡΠ°Π½Ρ Π·Π°Π³Π°Π»ΡΠ½Ρ Π½Π°ΡΠΊΠΎΠ²Ρ ΠΌΠ΅ΡΠΎΠ΄ΠΈ Π΄ΠΎΡΠ»ΡΠ΄ΠΆΠ΅Π½Ρ (ΠΏΠΎΡΡΠ²Π½ΡΠ½Π½Ρ, ΡΠ·Π°Π³Π°Π»ΡΠ½Π΅Π½Π½Ρ, ΠΌΠ΅ΡΠΎΠ΄ Π°Π½Π°Π»ΠΎΠ³ΡΠΉ, ΡΡΡΡΠΊΡΡΡΠ½ΠΈΠΉ Π°Π½Π°Π»ΡΠ· ΡΠ° ΡΠΈΠ½ΡΠ΅Π·), ΠΌΠ΅ΡΠΎΠ΄ΠΈ Π»ΠΎΠ³ΡΠΊΠΎ-ΡΠ΅ΠΎΡΠ΅ΡΠΈΡΠ½ΠΎΠ³ΠΎ Π°Π½Π°Π»ΡΠ·Ρ, ΡΠΏΠ΅ΡΡΠ°Π»ΡΠ½Ρ Π΅ΠΊΠΎΠ½ΠΎΠΌΡΠΊΠΎ-ΠΌΠ°ΡΠ΅ΠΌΠ°ΡΠΈΡΠ½Ρ ΠΌΠ΅ΡΠΎΠ΄ΠΈ. ΠΠΎΡΠΌΠ°ΡΠΈΠ²Π½ΠΎΡ Π±Π°Π·ΠΎΡ Π΄Π»Ρ Π΄ΠΎΡΠ»ΡΠ΄ΠΆΠ΅Π½Π½Ρ Π±ΡΠ»ΠΈ ΠΎΡΡΡΡΠΉΠ½Ρ Π΄ΠΎΠΊΡΠΌΠ΅Π½ΡΠΈ, ΡΠΎ Π²ΡΠ΄ΠΎΠ±ΡΠ°ΠΆΠ°ΡΡΡ ΡΠ° ΡΠ΅Π³ΡΠ»ΡΡΡΡ ΠΏΠ΅Π²Π½Ρ Π°ΡΠΏΠ΅ΠΊΡΠΈ ΡΠΈΡΡΠ΅ΠΌΠΈ ΡΠΏΠΎΠΆΠΈΠ²Π°Π½Π½Ρ Π΅Π½Π΅ΡΠ³ΡΡ ΠΏΡΠΈ Π·Π±ΠΎΡΡ, ΠΎΠ±ΡΠΎΠ±ΡΡ ΡΠ° ΠΏΡΠ΅Π΄ΡΡΠ°Π²Π»Π΅Π½Π½Ρ ΡΠ½ΡΠΎΡΠΌΠ°ΡΡΡ. Π―ΠΊ ΡΠ½ΡΠΎΡΠΌΠ°ΡΡΠΉΠ½Ρ Π΄ΠΆΠ΅ΡΠ΅Π»Π° Π²ΠΈΠΊΠΎΡΠΈΡΡΠ°Π½Ρ ΠΌΠ°ΡΠ΅ΡΡΠ°Π»ΠΈ Π½Π°ΡΠΊΠΎΠ²ΠΈΡ
ΠΊΠΎΠ½ΡΠ΅ΡΠ΅Π½ΡΡΠΉ ΡΠ° ΡΠ΅ΠΌΡΠ½Π°ΡΡΠ², ΡΠ΅ΡΡΡΡΠΈ Π³Π»ΠΎΠ±Π°Π»ΡΠ½ΠΎΡ ΡΠ½ΡΠΎΡΠΌΠ°ΡΡΠΉΠ½ΠΎΡ ΡΠΈΡΡΠ΅ΠΌΠΈ ΠΠ½ΡΠ΅ΡΠ½Π΅ΡΡ, ΡΠ½ΡΠΎΡΠΌΠ°ΡΡΡ ΠΠ΅ΡΠΆΠ°Π²Π½ΠΎΡ ΡΠ»ΡΠΆΠ±ΠΈ ΡΡΠ°ΡΠΈΡΡΠΈΠΊΠΈ Π£ΠΊΡΠ°ΡΠ½ΠΈ. Π’Π΅ΠΎΡΠ΅ΡΠΈΡΠ½Ρ ΠΎΡΠ½ΠΎΠ²ΠΈ Π΄ΠΎΡΠ»ΡΠ΄ΠΆΠ΅Π½Π½Ρ, ΡΠΎ ΠΎΠ±ΡΠ»ΡΠ³ΠΎΠ²ΡΡΡΡΡΡ Π½Π°ΡΠΊΠΎΠ²ΠΈΠΌΠΈ ΡΠΎΠ±ΠΎΡΠ°ΠΌΠΈ Π²ΡΡΡΠΈΠ·Π½ΡΠ½ΠΈΡ
ΡΠ° Π·Π°ΡΡΠ±ΡΠΆΠ½ΠΈΡ
Π΄ΠΎΡΠ»ΡΠ΄Π½ΠΈΠΊΡΠ² Ρ Π³Π°Π»ΡΠ·Ρ Π΅Π½Π΅ΡΠ³ΠΎΠ·Π°Π±Π΅Π·ΠΏΠ΅ΡΠ΅Π½Π½Ρ Π² ΠΏΠ΅ΡΠ΅Ρ
ΡΠ΄Π½ΡΠΉ Π΅ΠΊΠΎΠ½ΠΎΠΌΡΡΡ. ΠΠΎΠΌΠΏΠ»Π΅ΠΊΡ ΡΠ΅Π³ΡΠ΅ΡΡΠΉΠ½ΠΈΡ
ΡΠ° ΡΠ½Π΄Π΅ΠΊΡΠ½ΠΈΡ
ΠΌΠ΅ΡΠΎΠ΄ΡΠ² ΡΠ° ΠΌΠΎΠ΄Π΅Π»Π΅ΠΉ Π°Π½Π°Π»ΡΠ·Ρ ΡΠΏΠΎΠΆΠΈΠ²Π°Π½Π½Ρ Π΅Π»Π΅ΠΊΡΡΠΎΠ΅Π½Π΅ΡΠ³ΡΡ Π΄Π»Ρ Π²ΠΈΠ·Π½Π°ΡΠ΅Π½Π½Ρ ΡΡΠ°Π½ΡΡΠΎΡΠΌΠ°ΡΡΠΉΠ½ΠΈΡ
Π·ΠΌΡΠ½ ΠΊΠΎΠΌΠΏΠΎΠ½Π΅Π½ΡΡΠ² ΡΠΏΠΎΠΆΠΈΠ²Π°Π½Π½Ρ Π΅Π»Π΅ΠΊΡΡΠΈΡΠ½ΠΎΡ Π΅Π½Π΅ΡΠ³ΡΡ.
Π Π΅Π·ΡΠ»ΡΡΠ°ΡΠΈ. ΠΡΠΎΠ°Π½Π°Π»ΡΠ·ΠΎΠ²Π°Π½ΠΎ ΠΏΠ°ΡΠ°ΠΌΠ΅ΡΡΠΈ ΡΠΏΠΎΠΆΠΈΠ²Π°Π½Π½Ρ Π΅Π»Π΅ΠΊΡΡΠΎΠ΅Π½Π΅ΡΠ³ΡΡ Π½Π° Π·Π°Π»ΡΠ·ΠΎΡΡΠ΄Π½ΠΈΡ
ΠΏΡΠ΄ΠΏΡΠΈΡΠΌΡΡΠ²Π°Ρ
ΠΡΠΈΠ²ΠΎΡΡΠ·ΡΠΊΠΎΠ³ΠΎ ΡΠ΅Π³ΡΠΎΠ½Ρ. ΠΠΎΡΠ»ΡΠ΄ΠΆΠ΅Π½ΠΎ ΠΏΡΠΎΡΠ΅Ρ ΡΠΎΡΠΌΡΠ²Π°Π½Π½Ρ ΡΠΈΡΡΠ΅ΠΌΠΈ ΠΌΠΎΠ΄Π΅Π»Π΅ΠΉ Π΄Π»Ρ Π²ΠΈΡΡΡΠ΅Π½Π½Ρ ΠΏΡΠΎΠ±Π»Π΅ΠΌΠΈ ΠΎΠΏΡΠΈΠΌΡΠ·Π°ΡΡΡ Π²Π°ΡΡΡΡΠ½ΠΈΡ
Ρ
Π°ΡΠ°ΠΊΡΠ΅ΡΠΈΡΡΠΈΠΊ ΡΠΏΠΎΠΆΠΈΠ²Π°Π½Π½Ρ Π΅Π»Π΅ΠΊΡΡΠΎΠ΅Π½Π΅ΡΠ³ΡΡ. ΠΠΈΠ·Π½Π°ΡΠ΅Π½ΠΎ ΡΠΈΡΡΠ΅ΠΌΠ½Ρ ΠΊΠΎΡΠΏΠΎΡΠ°ΡΠΈΠ²Π½Ρ Ρ
Π°ΡΠ°ΠΊΡΠ΅ΡΠΈΡΡΠΈΠΊΠΈ ΡΠΈΡΡΠ΅ΠΌ Π΅Π½Π΅ΡΠ³ΠΎΡΠΏΠΎΠΆΠΈΠ²Π°Π½Π½Ρ Π·Π°Π»ΡΠ·ΠΎΡΡΠ΄Π½ΠΈΡ
ΠΏΡΠ΄ΠΏΡΠΈΡΠΌΡΡΠ² ΠΡΠΈΠ²ΠΎΡΡΠ·ΡΠΊΠΎΠ³ΠΎ ΡΠ΅Π³ΡΠΎΠ½Ρ. Π‘ΡΠΎΡΠΌΠΎΠ²Π°Π½ΠΎ ΡΠ½ΡΡΡΡΠΌΠ΅Π½ΡΠ°ΡΡΠΉ Π΅ΠΊΠΎΠ½ΠΎΠΌΡΡΠ½ΠΎΠ³ΠΎ ΡΠ° ΠΌΠ°ΡΠ΅ΠΌΠ°ΡΠΈΡΠ½ΠΎΠ³ΠΎ ΠΌΠΎΠ΄Π΅Π»ΡΠ²Π°Π½Π½Ρ Π· ΠΌΠ΅ΡΠΎΡ Π°Π½Π°Π»ΡΠ·Ρ ΡΠ° ΠΎΡΡΠ½ΡΠ²Π°Π½Π½Ρ ΠΏΠΎΠΊΠ°Π·Π½ΠΈΠΊΡΠ² Π²Π°ΡΡΠΎΡΡΡ ΡΠΈΡΡΠ΅ΠΌ Π΅Π½Π΅ΡΠ³ΠΎΡΠΏΠΎΠΆΠΈΠ²Π°Π½Π½Ρ. ΠΠ°ΡΠΌΠΎΠ½ΡΠ·Π°ΡΡΡ ΠΌΠ΅ΡΠΎΠ΄ΡΠ² ΠΌΠΎΠ΄Π΅Π»ΡΠ²Π°Π½Π½Ρ Π΄ΠΎΠ·Π²ΠΎΠ»ΠΈΠ»Π° Π²ΠΈΠ·Π½Π°ΡΠΈΡΠΈ Π²Π°ΡΡΡΡΠ½Ρ Ρ
Π°ΡΠ°ΠΊΡΠ΅ΡΠΈΡΡΠΈΠΊΠΈ ΡΠ° Π΄ΠΎΠ²Π΅ΡΡΠΈ ΡΠ°ΡΡΠΎΠ½Π°Π»ΡΠ½ΡΡΡΡ Π·Π°ΡΡΠΎΡΡΠ²Π°Π½Π½Ρ ΠΌΠΎΠ΄Π΅Π»Π΅ΠΉ, ΡΠΎΠ·ΡΠ°Ρ
ΡΠ²Π°ΡΠΈ Π΅ΡΠ΅ΠΊΡΠΈΠ²Π½ΠΈΠΉ ΡΠΎΠ·ΠΏΠΎΠ΄ΡΠ» ΡΠ΅ΡΡΡΡΡΠ², Π½Π°Π΄Π°ΡΠΈ ΡΠ΅ΠΊΠΎΠΌΠ΅Π½Π΄Π°ΡΡΡ Π²ΡΠ΄ΠΏΠΎΠ²ΡΠ΄Π½ΠΎ Π΄ΠΎ ΡΠ°ΡΡΠΎΠ½Π°Π»ΡΠ½ΠΈΡ
ΡΠΏΡΠ°Π²Π»ΡΠ½ΡΡΠΊΠΈΡ
ΡΡΡΠ΅Π½Ρ ΡΠΎΠ΄ΠΎ ΡΠΎΡΠΌΡΠ²Π°Π½Π½Ρ ΡΠΏΠΎΠΆΠΈΠ²Π°Π½Π½Ρ Π΅Π»Π΅ΠΊΡΡΠΎΠ΅Π½Π΅ΡΠ³ΡΡ.
ΠΠ°ΡΠΊΠΎΠ²Π° Π½ΠΎΠ²ΠΈΠ·Π½Π°. ΠΠ°ΠΏΡΠΎΠΏΠΎΠ½ΠΎΠ²Π°Π½ΠΎ ΡΠ½Π½ΠΎΠ²Π°ΡΡΠΉΠ½ΠΈΠΉ ΠΊΠΎΠΌΠΏΠ»Π΅ΠΊΡΠ½ΠΈΠΉ ΠΏΡΠ΄Ρ
ΡΠ΄ Π΄ΠΎ ΡΠΎΡΠΌΡΠ²Π°Π½Π½Ρ ΠΊΠΎΡΠΏΠΎΡΠ°ΡΠΈΠ²Π½ΠΈΡ
ΠΌΠΎΠ΄Π΅Π»Π΅ΠΉ ΡΠΈΡΡΠ΅ΠΌ Π΅Π»Π΅ΠΊΡΡΠΎΠΏΠΎΡΡΠ°ΡΠ°Π½Π½Ρ, ΡΠΎ ΠΏΠΎΠ»ΡΠ³Π°Ρ Ρ Π²ΠΈΠΊΠΎΡΠΈΡΡΠ°Π½Π½Ρ ΡΠ½Π΄Π΅ΠΊΡΠ½ΠΎΡ ΠΌΠ΅ΡΠΎΠ΄ΠΎΠ»ΠΎΠ³ΡΡ Π² ΠΏΠΎΡΠ΄Π½Π°Π½Π½Ρ Π· ΠΌΠ΅ΡΠΎΠ΄Π°ΠΌΠΈ Π½Π°ΠΉΠΌΠ΅Π½ΡΠΈΡ
ΠΌΠΎΠ΄ΡΠ»ΡΠ². Π¦Π΅ Π΄ΠΎΠ·Π²ΠΎΠ»ΡΡ ΠΎΠΏΡΠΈΠΌΡΠ·ΡΠ²Π°ΡΠΈ Π²ΠΈΡΡΠ°ΡΠΈ Π΅Π»Π΅ΠΊΡΡΠΎΠ΅Π½Π΅ΡΠ³ΡΡ Ρ Π·Π°Π±Π΅Π·ΠΏΠ΅ΡΠΈΡΠΈ ΡΠ°ΡΡΠΎΠ½Π°Π»ΡΠ½Π΅ ΡΠΏΡΠ°Π²Π»ΡΠ½Π½Ρ Π΅Π»Π΅ΠΊΡΡΠΎΡΠΏΠΎΠΆΠΈΠ²Π°Π½Π½ΡΠΌ.
ΠΡΠ°ΠΊΡΠΈΡΠ½Π° Π·Π½Π°ΡΠΈΠΌΡΡΡΡ. Π€ΠΎΡΠΌΡΠ²Π°Π½Π½Ρ ΠΊΠΎΡΠΏΠΎΡΠ°ΡΠΈΠ²Π½ΠΈΡ
ΠΌΠΎΠ΄Π΅Π»Π΅ΠΉ Ρ ΠΎΡΠ½ΠΎΠ²ΠΎΡ Π΄Π»Ρ ΠΏΠΎΠ΄Π°Π»ΡΡΠΎΠ³ΠΎ Π΄ΠΎΡΠ»ΡΠ΄ΠΆΠ΅Π½Π½Ρ Ρ ΠΏΠΎΠ±ΡΠ΄ΠΎΠ²ΠΈ Π±Π°Π³Π°ΡΠΎΡΠ°ΠΊΡΠΎΡΠ½ΠΈΡ
ΡΠ΅Π³ΡΠ΅ΡΡΠΉΠ½ΠΈΡ
ΠΌΠΎΠ΄Π΅Π»Π΅ΠΉ ΡΠ° ΠΌΠΎΠ΄Π΅Π»Π΅ΠΉ Π΄Π»Ρ ΠΏΡΠΎΠ³Π½ΠΎΠ·ΡΠ²Π°Π½Π½Ρ ΡΠΏΠΎΠΆΠΈΠ²Π°Π½Π½Ρ Π΅Π»Π΅ΠΊΡΡΠΎΠ΅Π½Π΅ΡΠ³ΡΡ. ΠΡΠ°ΠΊΡΠΈΡΠ½ΠΈΠΉ Π΄ΠΎΡΠ²ΡΠ΄ Π²ΠΈΠΊΠΎΡΠΈΡΡΠ°Π½Π½Ρ Π·Π°ΠΏΡΠΎΠΏΠΎΠ½ΠΎΠ²Π°Π½ΠΎΡ ΠΌΠ΅ΡΠΎΠ΄ΠΎΠ»ΠΎΠ³ΡΡ Π΄ΠΎΠ²Π΅Π»ΠΈ ΡΠ²ΠΎΡ Π΅ΡΠ΅ΠΊΡΠΈΠ²Π½ΡΡΡΡ ΠΏΡΠΈ ΠΏΡΠΈΠΉΠ½ΡΡΡΡ ΡΠΏΡΠ°Π²Π»ΡΠ½ΡΡΠΊΠΈΡ
ΡΡΡΠ΅Π½Ρ Π· ΠΌΠ΅ΡΠΎΡ Π·Π°Π±Π΅Π·ΠΏΠ΅ΡΠ΅Π½Π½Ρ ΠΎΠΏΡΠΈΠΌΠ°Π»ΡΠ½ΠΈΡ
Π²ΠΈΡΡΠ°ΡΠ½ΠΈΡ
Ρ
Π°ΡΠ°ΠΊΡΠ΅ΡΠΈΡΡΠΈΠΊ ΡΠΏΠΎΠΆΠΈΠ²Π°Π½Π½Ρ Π΅Π»Π΅ΠΊΡΡΠΎΠ΅Π½Π΅ΡΠ³ΡΡ.Π¦Π΅Π»Ρ. ΠΠ·ΡΡΠ΅Π½ΠΈΠ΅ ΠΊΠΎΡΠΏΠΎΡΠ°ΡΠΈΠ²Π½ΡΡ
Ρ
Π°ΡΠ°ΠΊΡΠ΅ΡΠΈΡΡΠΈΠΊ ΡΠΈΡΡΠ΅ΠΌ ΡΠ»Π΅ΠΊΡΡΠΎΡΠ½Π°Π±ΠΆΠ΅Π½ΠΈΡ, ΡΠΎΡΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΡ ΠΏΡΠΈΠΊΠ»Π°Π΄Π½ΠΎΠ³ΠΎ Π½Π°ΡΡΠ½ΠΎ-ΠΌΠ΅ΡΠΎΠ΄ΠΈΡΠ΅ΡΠΊΠΎΠ³ΠΎ ΠΎΠ±Π΅ΡΠΏΠ΅ΡΠ΅Π½ΠΈΡ ΠΈ ΠΈΠ½ΡΡΡΡΠΌΠ΅Π½ΡΠ°ΡΠΈΡ ΡΠΊΠΎΠ½ΠΎΠΌΠΈΠΊΠΎ-ΠΌΠ°ΡΠ΅ΠΌΠ°ΡΠΈΡΠ΅ΡΠΊΠΎΠ³ΠΎ ΠΌΠΎΠ΄Π΅Π»ΠΈΡΠΎΠ²Π°Π½ΠΈΡ Π΄Π»Ρ Π°Π½Π°Π»ΠΈΠ·Π° ΠΈ ΡΡΠΎΠΈΠΌΠΎΡΡΠ½ΡΡ
Ρ
Π°ΡΠ°ΠΊΡΠ΅ΡΠΈΡΡΠΈΠΊ ΡΠ»Π΅ΠΊΡΡΠΎΠΏΠΎΡΡΠ΅Π±Π»Π΅Π½ΠΈΡ.
ΠΠ΅ΡΠΎΠ΄ΠΈΠΊΠ°. ΠΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½ΠΈΠ΅ ΠΎΡΠ½ΠΎΠ²Π°Π½ΠΎ Π½Π° ΠΈΡΠΏΠΎΠ»ΡΠ·ΠΎΠ²Π°Π½ΠΈΠΈ Π·Π°ΠΊΠΎΠ½ΠΎΠ², Π·Π°ΠΊΠΎΠ½ΠΎΠΌΠ΅ΡΠ½ΠΎΡΡΠ΅ΠΉ ΠΈ ΠΊΠ°ΡΠ΅Π³ΠΎΡΠΈΡΠ΅ΡΠΊΠΎΠ³ΠΎ Π°ΠΏΠΏΠ°ΡΠ°ΡΠ°. Π ΠΏΡΠΎΡΠ΅ΡΡΠ΅ Π½Π°ΡΡΠ½ΡΡ
ΠΈΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½ΠΈΠΉ Π±ΡΠ»ΠΈ ΠΈΡΠΏΠΎΠ»ΡΠ·ΠΎΠ²Π°Π½Ρ ΠΎΠ±ΡΠΈΠ΅ Π½Π°ΡΡΠ½ΡΠ΅ ΠΌΠ΅ΡΠΎΠ΄Ρ ΠΈΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½ΠΈΡ (ΡΡΠ°Π²Π½Π΅Π½ΠΈΠ΅, ΠΎΠ±ΠΎΠ±ΡΠ΅Π½ΠΈΠ΅, ΠΌΠ΅ΡΠΎΠ΄ Π°Π½Π°Π»ΠΎΠ³ΠΈΠΉ, ΡΡΡΡΠΊΡΡΡΠ½ΡΠΉ Π°Π½Π°Π»ΠΈΠ· ΠΈ ΡΠΈΠ½ΡΠ΅Π·), ΠΌΠ΅ΡΠΎΠ΄Ρ Π»ΠΎΠ³ΠΈΠΊΠΎ-ΡΠ΅ΠΎΡΠ΅ΡΠΈΡΠ΅ΡΠΊΠΎΠ³ΠΎ Π°Π½Π°Π»ΠΈΠ·Π°, ΡΠΏΠ΅ΡΠΈΠ°Π»ΡΠ½ΡΠ΅ ΡΠΊΠΎΠ½ΠΎΠΌΠΈΠΊΠΎ-ΠΌΠ°ΡΠ΅ΠΌΠ°ΡΠΈΡΠ΅ΡΠΊΠΈΠ΅ ΠΌΠ΅ΡΠΎΠ΄Ρ. ΠΠΎΡΠΌΠ°ΡΠΈΠ²Π½ΠΎΠΉ Π±Π°Π·ΠΎΠΉ Π΄Π»Ρ ΠΈΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½ΠΈΡ Π±ΡΠ»ΠΈ ΠΎΡΠΈΡΠΈΠ°Π»ΡΠ½ΡΠ΅ Π΄ΠΎΠΊΡΠΌΠ΅Π½ΡΡ, ΠΎΡΡΠ°ΠΆΠ°ΡΡΠΈΠ΅ ΠΈ ΡΠ΅Π³ΡΠ»ΠΈΡΡΡΡΠΈΠ΅ ΠΎΠΏΡΠ΅Π΄Π΅Π»Π΅Π½Π½ΡΠ΅ Π°ΡΠΏΠ΅ΠΊΡΡ ΡΠΈΡΡΠ΅ΠΌΡ ΠΏΠΎΡΡΠ΅Π±Π»Π΅Π½ΠΈΡ ΡΠ½Π΅ΡΠ³ΠΈΠΈ ΠΏΡΠΈ ΡΠ±ΠΎΡΠ΅, ΠΎΠ±ΡΠ°Π±ΠΎΡΠΊΠ΅ ΠΈ ΠΏΡΠ΅Π΄ΡΡΠ°Π²Π»Π΅Π½ΠΈΠΈ ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΈ. ΠΠ°ΠΊ ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΎΠ½Π½ΡΠ΅ ΠΈΡΡΠΎΡΠ½ΠΈΠΊΠΈ, ΠΈΡΠΏΠΎΠ»ΡΠ·ΠΎΠ²Π°Π½Π½ΡΠ΅ ΠΌΠ°ΡΠ΅ΡΠΈΠ°Π»Ρ Π½Π°ΡΡΠ½ΡΡ
ΠΊΠΎΠ½ΡΠ΅ΡΠ΅Π½ΡΠΈΠΉ ΠΈ ΡΠ΅ΠΌΠΈΠ½Π°ΡΠΎΠ², ΡΠ΅ΡΡΡΡΡ Π³Π»ΠΎΠ±Π°Π»ΡΠ½ΠΎΠΉ ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΎΠ½Π½ΠΎΠΉ ΡΠΈΡΡΠ΅ΠΌΡ ΠΠ½ΡΠ΅ΡΠ½Π΅ΡΠ°, ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΡ ΠΠΎΡΡΠ΄Π°ΡΡΡΠ²Π΅Π½Π½ΠΎΠΉ ΡΠ»ΡΠΆΠ±Ρ ΡΡΠ°ΡΠΈΡΡΠΈΠΊΠΈ Π£ΠΊΡΠ°ΠΈΠ½Ρ. Π’Π΅ΠΎΡΠ΅ΡΠΈΡΠ΅ΡΠΊΠΈΠ΅ ΠΎΡΠ½ΠΎΠ²Ρ ΠΈΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½ΠΈΡ, ΠΎΠ±ΡΠ»ΡΠΆΠΈΠ²Π°Π΅ΠΌΡΡ
Π½Π°ΡΡΠ½ΡΠΌΠΈ ΡΠ°Π±ΠΎΡΠ°ΠΌΠΈ ΠΎΡΠ΅ΡΠ΅ΡΡΠ²Π΅Π½Π½ΡΡ
ΠΈ Π·Π°ΡΡΠ±Π΅ΠΆΠ½ΡΡ
ΠΈΡΡΠ»Π΅Π΄ΠΎΠ²Π°ΡΠ΅Π»Π΅ΠΉ Π² ΠΎΠ±Π»Π°ΡΡΠΈ ΡΠ½Π΅ΡΠ³ΠΎΠΎΠ±Π΅ΡΠΏΠ΅ΡΠ΅Π½ΠΈΡ Π² ΠΏΠ΅ΡΠ΅Ρ
ΠΎΠ΄Π½ΠΎΠΉ ΡΠΊΠΎΠ½ΠΎΠΌΠΈΠΊΠ΅. ΠΠΎΠΌΠΏΠ»Π΅ΠΊΡ ΡΠ΅Π³ΡΠ΅ΡΡΠΈΠΎΠ½Π½ΡΡ
ΠΈ ΠΈΠ½Π΄Π΅ΠΊΡΠ½ΡΡ
ΠΌΠ΅ΡΠΎΠ΄ΠΎΠ² ΠΈ ΠΌΠΎΠ΄Π΅Π»Π΅ΠΉ Π°Π½Π°Π»ΠΈΠ·Π° ΠΏΠΎΡΡΠ΅Π±Π»Π΅Π½ΠΈΡ ΡΠ»Π΅ΠΊΡΡΠΎΡΠ½Π΅ΡΠ³ΠΈΠΈ Π΄Π»Ρ ΠΎΠΏΡΠ΅Π΄Π΅Π»Π΅Π½ΠΈΡ ΡΡΠ°Π½ΡΡΠΎΡΠΌΠ°ΡΠΈΠΎΠ½Π½ΡΡ
ΠΈΠ·ΠΌΠ΅Π½Π΅Π½ΠΈΠΉ ΠΊΠΎΠΌΠΏΠΎΠ½Π΅Π½ΡΠΎΠ² ΠΏΠΎΡΡΠ΅Π±Π»Π΅Π½ΠΈΡ ΡΠ»Π΅ΠΊΡΡΠΈΡΠ΅ΡΠΊΠΎΠΉ ΡΠ½Π΅ΡΠ³ΠΈΠΈ.
Π Π΅Π·ΡΠ»ΡΡΠ°ΡΡ. ΠΡΠΎΠ°Π½Π°Π»ΠΈΠ·ΠΈΡΠΎΠ²Π°Π½Ρ ΠΏΠ°ΡΠ°ΠΌΠ΅ΡΡΡ ΠΏΠΎΡΡΠ΅Π±Π»Π΅Π½ΠΈΡ ΡΠ»Π΅ΠΊΡΡΠΎΡΠ½Π΅ΡΠ³ΠΈΠΈ Π½Π° ΠΆΠ΅Π»Π΅Π·ΠΎΡΡΠ΄Π½ΡΡ
ΠΏΡΠ΅Π΄ΠΏΡΠΈΡΡΠΈΡΡ
ΠΡΠΈΠ²ΠΎΡΠΎΠΆΡΠΊΠΎΠ³ΠΎ ΡΠ΅Π³ΠΈΠΎΠ½Π°. ΠΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½ ΠΏΡΠΎΡΠ΅ΡΡ ΡΠΎΡΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΡ ΡΠΈΡΡΠ΅ΠΌΡ ΠΌΠΎΠ΄Π΅Π»Π΅ΠΉ Π΄Π»Ρ ΡΠ΅ΡΠ΅Π½ΠΈΡ ΠΏΡΠΎΠ±Π»Π΅ΠΌΡ ΠΎΠΏΡΠΈΠΌΠΈΠ·Π°ΡΠΈΠΈ ΡΡΠΎΠΈΠΌΠΎΡΡΠ½ΡΡ
Ρ
Π°ΡΠ°ΠΊΡΠ΅ΡΠΈΡΡΠΈΠΊ ΠΏΠΎΡΡΠ΅Π±Π»Π΅Π½ΠΈΡ ΡΠ»Π΅ΠΊΡΡΠΎΡΠ½Π΅ΡΠ³ΠΈΠΈ. ΠΠΏΡΠ΅Π΄Π΅Π»Π΅Π½Ρ ΠΊΠΎΡΠΏΠΎΡΠ°ΡΠΈΠ²Π½ΡΠ΅ Ρ
Π°ΡΠ°ΠΊΡΠ΅ΡΠΈΡΡΠΈΠΊΠΈ ΡΠΈΡΡΠ΅ΠΌ ΡΠ½Π΅ΡΠ³ΠΎΠΏΠΎΡΡΠ΅Π±Π»Π΅Π½ΠΈΡ ΠΆΠ΅Π»Π΅Π·ΠΎΡΡΠ΄Π½ΡΡ
ΠΏΡΠ΅Π΄ΠΏΡΠΈΡΡΠΈΠΉ ΠΡΠΈΠ²ΠΎΡΠΎΠΆΡΠΊΠΎΠ³ΠΎ ΡΠ΅Π³ΠΈΠΎΠ½Π°. Π‘ΡΠΎΡΠΌΠΈΡΠΎΠ²Π°Π½ ΠΈΠ½ΡΡΡΡΠΌΠ΅Π½ΡΠ°ΡΠΈΠΉ ΠΌΠΎΠ΄Π΅Π»ΠΈΡΠΎΠ²Π°Π½ΠΈΡ Ρ ΡΠ΅Π»ΡΡ Π°Π½Π°Π»ΠΈΠ·Π° ΠΈ ΠΎΡΠ΅Π½ΠΊΠΈ ΠΏΠΎΠΊΠ°Π·Π°ΡΠ΅Π»Π΅ΠΉ ΡΡΠΎΠΈΠΌΠΎΡΡΠΈ ΡΠΈΡΡΠ΅ΠΌ ΡΠ½Π΅ΡΠ³ΠΎΠΏΠΎΡΡΠ΅Π±Π»Π΅Π½ΠΈΡ. ΠΠ°ΡΠΌΠΎΠ½ΠΈΠ·Π°ΡΠΈΡ ΠΌΠ΅ΡΠΎΠ΄ΠΎΠ² ΠΌΠΎΠ΄Π΅Π»ΠΈΡΠΎΠ²Π°Π½ΠΈΡ ΠΏΠΎΠ·Π²ΠΎΠ»ΠΈΠ»Π° ΠΎΠΏΡΠ΅Π΄Π΅Π»ΠΈΡΡ ΡΡΠΎΠΈΠΌΠΎΡΡΠ½ΡΠ΅ Ρ
Π°ΡΠ°ΠΊΡΠ΅ΡΠΈΡΡΠΈΠΊΠΈ ΠΈ Π΄ΠΎΠΊΠ°Π·Π°ΡΡ ΡΠ°ΡΠΈΠΎΠ½Π°Π»ΡΠ½ΠΎΡΡΡ ΠΏΡΠΈΠΌΠ΅Π½Π΅Π½ΠΈΡ ΠΌΠΎΠ΄Π΅Π»Π΅ΠΉ, ΡΠ°ΡΡΡΠΈΡΠ°ΡΡ ΡΡΡΠ΅ΠΊΡΠΈΠ²Π½ΠΎΠ΅ ΡΠ°ΡΠΏΡΠ΅Π΄Π΅Π»Π΅Π½ΠΈΠ΅ ΡΠ΅ΡΡΡΡΠΎΠ², Π΄Π°ΡΡ ΡΠ΅ΠΊΠΎΠΌΠ΅Π½Π΄Π°ΡΠΈΠΈ Π² ΡΠΎΠΎΡΠ²Π΅ΡΡΡΠ²ΠΈΠΈ Ρ ΡΠ°ΡΠΈΠΎΠ½Π°Π»ΡΠ½ΡΠΌΠΈ ΡΠΏΡΠ°Π²Π»Π΅Π½ΡΠ΅ΡΠΊΠΈΠΌΠΈ ΡΠ΅ΡΠ΅Π½ΠΈΡΠΌΠΈ ΠΏΠΎ ΡΠΎΡΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΡ ΠΏΠΎΡΡΠ΅Π±Π»Π΅Π½ΠΈΡ ΡΠ»Π΅ΠΊΡΡΠΎΡΠ½Π΅ΡΠ³ΠΈΠΈ.
ΠΠ°ΡΡΠ½Π°Ρ Π½ΠΎΠ²ΠΈΠ·Π½Π°. ΠΡΠ΅Π΄Π»ΠΎΠΆΠ΅Π½ ΠΈΠ½Π½ΠΎΠ²Π°ΡΠΈΠΎΠ½Π½ΡΠΉ ΠΊΠΎΠΌΠΏΠ»Π΅ΠΊΡΠ½ΡΠΉ ΠΏΠΎΠ΄Ρ
ΠΎΠ΄ ΠΊ ΡΠΎΡΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΡ ΠΊΠΎΡΠΏΠΎΡΠ°ΡΠΈΠ²Π½ΡΡ
ΠΌΠΎΠ΄Π΅Π»Π΅ΠΉ ΡΠΈΡΡΠ΅ΠΌ ΡΠ»Π΅ΠΊΡΡΠΎΡΠ½Π°Π±ΠΆΠ΅Π½ΠΈΡ Π·Π°ΠΊΠ»ΡΡΠ°ΡΡΠΈΠΉΡΡ Π² ΠΈΡΠΏΠΎΠ»ΡΠ·ΠΎΠ²Π°Π½ΠΈΠΈ ΠΌΠ΅ΡΠΎΠ΄ΠΎΠ»ΠΎΠ³ΠΈΠΈ ΠΈΠ½Π΄Π΅ΠΊΡΠΎΠ² Π² ΡΠΎΡΠ΅ΡΠ°Π½ΠΈΠΈ Ρ ΠΌΠ΅ΡΠΎΠ΄Π°ΠΌΠΈ Π½Π°ΠΈΠΌΠ΅Π½ΡΡΠΈΡ
ΠΌΠΎΠ΄ΡΠ»Π΅ΠΉ, ΡΡΠΎ ΠΏΠΎΠ·Π²ΠΎΠ»ΡΠ΅Ρ ΠΎΠΏΡΠΈΠΌΠΈΠ·ΠΈΡΠΎΠ²Π°ΡΡ Π·Π°ΡΡΠ°ΡΡ ΡΠ»Π΅ΠΊΡΡΠΎΡΠ½Π΅ΡΠ³ΠΈΠΈ ΠΈ ΠΎΡΡΡΠ΅ΡΡΠ²ΠΈΡΡ ΡΠ°ΡΠΈΠΎΠ½Π°Π»ΡΠ½ΠΎΠ΅ ΡΠΏΡΠ°Π²Π»Π΅Π½ΠΈΠ΅ ΡΠ»Π΅ΠΊΡΡΠΎΠΏΠΎΡΡΠ΅Π±Π»Π΅Π½ΠΈΠ΅ΠΌ.
ΠΡΠ°ΠΊΡΠΈΡΠ΅ΡΠΊΠ°Ρ Π·Π½Π°ΡΠΈΠΌΠΎΡΡΡ. Π€ΠΎΡΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ ΠΊΠΎΡΠΏΠΎΡΠ°ΡΠΈΠ²Π½ΡΡ
ΠΌΠΎΠ΄Π΅Π»Π΅ΠΉ ΡΠ²Π»ΡΠ΅ΡΡΡ ΠΎΡΠ½ΠΎΠ²ΠΎΠΉ Π΄Π»Ρ Π΄Π°Π»ΡΠ½Π΅ΠΉΡΠ΅Π³ΠΎ ΠΈΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½ΠΈΡ ΠΈ ΠΏΠΎΡΡΡΠΎΠ΅Π½ΠΈΡ ΠΌΠ½ΠΎΠ³ΠΎΡΠ°ΠΊΡΠΎΡΠ½ΡΡ
ΡΠ΅Π³ΡΠ΅ΡΡΠΈΠΎΠ½Π½ΡΡ
ΠΌΠΎΠ΄Π΅Π»Π΅ΠΉ ΠΈ ΠΌΠΎΠ΄Π΅Π»Π΅ΠΉ Π΄Π»Ρ ΠΏΡΠΎΠ³Π½ΠΎΠ·ΠΈΡΠΎΠ²Π°Π½ΠΈΡ ΠΏΠΎΡΡΠ΅Π±Π»Π΅Π½ΠΈΡ ΡΠ»Π΅ΠΊΡΡΠΎΡΠ½Π΅ΡΠ³ΠΈΠΈ. ΠΡΠ°ΠΊΡΠΈΡΠ΅ΡΠΊΠΈΠΉ ΠΎΠΏΡΡ ΠΈΡΠΏΠΎΠ»ΡΠ·ΠΎΠ²Π°Π½ΠΈΡ ΠΏΡΠ΅Π΄Π»ΠΎΠΆΠ΅Π½Π½ΠΎΠΉ ΠΌΠ΅ΡΠΎΠ΄ΠΎΠ»ΠΎΠ³ΠΈΠΈ Π΄ΠΎΠΊΠ°Π·Π°Π»ΠΈ ΡΠ²ΠΎΡ ΡΡΡΠ΅ΠΊΡΠΈΠ²Π½ΠΎΡΡΡ ΠΏΡΠΈ ΠΏΡΠΈΠ½ΡΡΠΈΠΈ ΡΠΏΡΠ°Π²Π»Π΅Π½ΡΠ΅ΡΠΊΠΈΡ
ΡΠ΅ΡΠ΅Π½ΠΈΠΉ Ρ ΡΠ΅Π»ΡΡ ΠΎΠ±Π΅ΡΠΏΠ΅ΡΠ΅Π½ΠΈΡ ΠΎΠΏΡΠΈΠΌΠ°Π»ΡΠ½ΡΡ
ΡΠ°ΡΡ
ΠΎΠ΄Π½ΡΡ
Ρ
Π°ΡΠ°ΠΊΡΠ΅ΡΠΈΡΡΠΈΠΊ ΠΏΠΎΡΡΠ΅Π±Π»Π΅Π½ΠΈΡ ΡΠ»Π΅ΠΊΡΡΠΎΡΠ½Π΅ΡΠ³ΠΈΠΈ.The author expresses particular gratitude to T.M. Beridze, Candidate of Engineering Sciences, Associate Professor, for consulting assistance in formulation of this scientific article
On maximal chain subgraphs and covers of bipartite graphs
In this paper, we address three related problems. One is the enumeration of all the maximal edge induced chain subgraphs of a bipartite graph, for which we provide a polynomial delay algorithm. We give bounds on the number of maximal chain subgraphs for a bipartite graph and use them to establish the input-sensitive complexity of the enumeration problem.
The second problem we treat is the one of finding the minimum number of chain subgraphs needed to cover all the edges a bipartite graph. For this we provide an exact exponential algorithm with a non trivial complexity. Finally, we approach the problem of enumerating all minimal chain subgraph covers of a bipartite graph and show that it can be solved in quasi-polynomial time
Exact Graph Coloring for Functional Decomposition: Do We Need It?
Finding column multiplicity index is one of important component processes in functional decomposition of discrete functions for circuit design and especially Data Mining applications. How important it is to solve this problem exactly from the point of view of the minimum complexity of decomposition, and related to it error in Machine Learning type of applications? In order to investigate this problem we wrote two graph coloring programs: exact program EXOC and approximate program DOM (DOM cab give provably exact results on some types of graphs). These programs were next incorporated into the multi-valued decomposer of functions and relations NVGUD. Extensive testing of MVGUD with these programs has been performed on various kinds of data. Based on these tests we demonstrated that exact graph coloring is not necessary for high-quality functional decomposers, especially in Data Mining applications, giving thus another argument that efficient and effective Machine Learning approach based on decomposition is possible
Different approaches to community detection
A precise definition of what constitutes a community in networks has remained
elusive. Consequently, network scientists have compared community detection
algorithms on benchmark networks with a particular form of community structure
and classified them based on the mathematical techniques they employ. However,
this comparison can be misleading because apparent similarities in their
mathematical machinery can disguise different reasons for why we would want to
employ community detection in the first place. Here we provide a focused review
of these different motivations that underpin community detection. This
problem-driven classification is useful in applied network science, where it is
important to select an appropriate algorithm for the given purpose. Moreover,
highlighting the different approaches to community detection also delineates
the many lines of research and points out open directions and avenues for
future research.Comment: 14 pages, 2 figures. Written as a chapter for forthcoming Advances in
network clustering and blockmodeling, and based on an extended version of The
many facets of community detection in complex networks, Appl. Netw. Sci. 2: 4
(2017) by the same author
Using similarity of graphs in evaluation of designs
This paper deals with evaluating design on the basis of their internal structures in the form of graphs. A set containing graphs representing solutions of similar design tasks is used to search for frequently occurring subgraphs. On the basis of the results of the search the quality of new solutions is evaluated. Moreover the common subgraphs found are considered to be design patterns characterizing a given design task solutions. The paper presents the generic concept of such an approach as well as illustrates it by the small example of floor layout design
Identifying combinations of tetrahedra into hexahedra: a vertex based strategy
Indirect hex-dominant meshing methods rely on the detection of adjacent
tetrahedra an algorithm that performs this identification and builds the set of
all possible combinations of tetrahedral elements of an input mesh T into
hexahedra, prisms, or pyramids. All identified cells are valid for engineering
analysis. First, all combinations of eight/six/five vertices whose connectivity
in T matches the connectivity of a hexahedron/prism/pyramid are computed. The
subset of tetrahedra of T triangulating each potential cell is then determined.
Quality checks allow to early discard poor quality cells and to dramatically
improve the efficiency of the method. Each potential hexahedron/prism/pyramid
is computed only once. Around 3 millions potential hexahedra are computed in 10
seconds on a laptop. We finally demonstrate that the set of potential hexes
built by our algorithm is significantly larger than those built using
predefined patterns of subdivision of a hexahedron in tetrahedral elements.Comment: Preprint submitted to CAD (26th IMR special issue
- β¦