Network Algorithms, Data Mining, and Applications -

Network Algorithms, Data Mining, and Applications

NET, Moscow, Russia, May 2018
Buch | Softcover
XIII, 244 Seiten
2021 | 1st ed. 2020
Springer International Publishing (Verlag)
978-3-030-37159-3 (ISBN)
106,99 inkl. MwSt
This proceedings presents the result of the 8th International Conference in Network Analysis, held at the Higher School of Economics, Moscow, in May 2018. The conference brought together scientists, engineers, and researchers from academia, industry, and government. 
Contributions in this book focus on the development of network algorithms for data mining and its applications. Researchers and students in mathematics, economics, statistics, computer science, and engineering find this collection a valuable resource filled with the latest research in network analysis. Computational aspects and applications of large-scale networks in market models, neural networks, social networks, power transmission grids, maximum clique problem, telecommunication networks, and complexity graphs are included with new tools for efficient network analysis of large-scale networks. Machine learning techniques in network settings including community detection, clustering, andbiclustering algorithms are presented with applications to social network analysis.

 Part I: Network algorithms.- Obaid, H. B. and Trafalis, T: Fairness in Resource Allocation: Foundation and Applications.- Ignatov, D., Ivanova, P., Zamaletdinova, A. and Prokopyev, O: Searching for Maximum Quasi-Bicliques with Mixed Integer Programming.- Miasnikof, P., Pitsoulis, L., Bonner, A. J., Lawryshyn, Y. and Pardalos, P. M: Graph Clustering Via Intra-Cluster Density Maximization.- Shvydun, S.: Computational Complexity of SRIC and LRIC indices.- Sifaleras, A. and Konstantaras, I: A survey on variable neighborhood search methods for supply network inventory.- Part II: Network Data Mining.- Ananyeva, M. and Makarov, I: GSM: Inductive Learning on Dynamic Graph Embeddings.- Averchenkova, A., Akhmetzyanova, A., Sudarikov, K., Sulimov, P., Makarov I. and Zhukov, L. E:  Collaborator Recommender System based on Co-authorship Network Analysis.- Demochkin, K. and Savchenko, A: User Preference Prediction in a Set of Photos based on Neural Aggregation Network.- Makrushin , S.: Network structure and scheme analysis of the Russian language segment of Wikipedia.- Meshcheryakova, N., Shvydun, S. and Aleskerov, F: Indirect Influence Assessment in the Context of Retail Food Network.- Sokolova, A. D. and Savchenko, A. V: Facial clustering in video data using deep convolutional neural networks.- Part III: Network Applications.- Egamov, A.: The existence and uniqueness theorem for initial-boundary value problem of the same class of integro-differential PDEs.- Gradoselskaya, G., Karpov, I. and Shcheglova, T: Mapping of politically active groups on social networks of Russian regions (on the example of Karachay-Cherkessia Republic).- Mikhailova, O., Gradoselskaya, G. and Kharlamov, A: Social Mechanisms of the Subject Area Formation. The Case of "Digital Economy.- Shcheglova, T., Gradoselskaya, G. and Karpov, I: Methodology for measuring polarization of political discourse: case of comparing oppositional and patriotic discourse in online social networks.- Zaytsev, D., Khvatsky, G., Talovsky, N. and Kuskova, V: Network Analysis Methodology of Policy Actors Identification and Power Evaluation (the case of the Unified State Exam introduction in Russia).

Erscheinungsdatum
Reihe/Serie Springer Proceedings in Mathematics & Statistics
Zusatzinfo XIII, 244 p. 65 illus., 43 illus. in color.
Verlagsort Cham
Sprache englisch
Maße 155 x 235 mm
Gewicht 403 g
Themenwelt Mathematik / Informatik Mathematik Angewandte Mathematik
Mathematik / Informatik Mathematik Graphentheorie
Schlagworte clusters • combinatorics • Gaussian Graphical Model • graph dissimilarities • Information Theory • Integer programming techniques • Large-Scale Graph Clustering • Large-Scale Graph Processing Systems • Link Partitioning • Machine Learning Analysis • Metaheuristics • modeling clique relaxations • network algorithms • Network data mining • Network Science Applications • Partitioning Around Medoids • Traveling Salesman Problem
ISBN-10 3-030-37159-X / 303037159X
ISBN-13 978-3-030-37159-3 / 9783030371593
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Anwendungen und Theorie von Funktionen, Distributionen und Tensoren

von Michael Karbach

Buch | Softcover (2023)
De Gruyter Oldenbourg (Verlag)
64,95
Berechnung statisch unbestimmter Tragwerke

von Raimond Dallmann

Buch | Hardcover (2022)
Hanser (Verlag)
29,99