Sometimes social networks frequently require multiple distinct types of connectivity information which can finally be derived as layers. This type of information retrieval can be represented as multi-layer graphs, where each layer contains a set of edges over the same underlying nodes of the base layer. The author proposes two algorithms namely MulCaDu and SoGraM. The first algorithm, MulCaDu represents a call-duration telephone graph as a multi-layer graph. So a total of four layers are generated namely base layer, sublayer-1 (low-call), sublayer-2 (medium-call), and sublayer-3 (high-call) respectively. The second algorithm, SoGraM represents a social graph as a multi-layer graph. For this, the author has chosen three examples of social graph namely Author Graph, Email Graph, and Telephone Graph. So, the Algorithm, SoGraM has successfully represented the Author Graph, Email Graph, and Telephone Graph as multi-layer graphs with three layers, four layers, and five layers respectively.
"synopsis" may belong to another edition of this title.
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Sometimes social networks frequently require multiple distinct types of connectivity information which can finally be derived as layers. This type of information retrieval can be represented as multi-layer graphs, where each layer contains a set of edges over the same underlying nodes of the base layer. The author proposes two algorithms namely MulCaDu and SoGraM. The first algorithm, MulCaDu represents a call-duration telephone graph as a multi-layer graph. So a total of four layers are generated namely base layer, sublayer-1 (low-call), sublayer-2 (medium-call), and sublayer-3 (high-call) respectively. The second algorithm, SoGraM represents a social graph as a multi-layer graph. For this, the author has chosen three examples of social graph namely Author Graph, Email Graph, and Telephone Graph. So, the Algorithm, SoGraM has successfully represented the Author Graph, Email Graph, and Telephone Graph as multi-layer graphs with three layers, four layers, and five layers respectively. 56 pp. Englisch. Seller Inventory # 9786139442669
Seller: Revaluation Books, Exeter, United Kingdom
Paperback. Condition: Brand New. 56 pages. 8.66x5.91x0.13 inches. In Stock. Seller Inventory # zk6139442664
Quantity: 1 available
Seller: moluna, Greven, Germany
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Rao BapujiB. Rao is currently working as Asst. Professor in the Dept. of CSEA at IGIT, Sarang, Odisha, India. He is pursuing Ph.D.(CSE) from BPUT, Rourkela, Odisha, India. He has received M.Tech (CS) from Berhampur University, Berham. Seller Inventory # 385858069
Quantity: Over 20 available
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Sometimes social networks frequently require multiple distinct types of connectivity information which can finally be derived as layers. This type of information retrieval can be represented as multi-layer graphs, where each layer contains a set of edges over the same underlying nodes of the base layer. The author proposes two algorithms namely MulCaDu and SoGraM. The first algorithm, MulCaDu represents a call-duration telephone graph as a multi-layer graph. So a total of four layers are generated namely base layer, sublayer-1 (low-call), sublayer-2 (medium-call), and sublayer-3 (high-call) respectively. The second algorithm, SoGraM represents a social graph as a multi-layer graph. For this, the author has chosen three examples of social graph namely Author Graph, Email Graph, and Telephone Graph. So, the Algorithm, SoGraM has successfully represented the Author Graph, Email Graph, and Telephone Graph as multi-layer graphs with three layers, four layers, and five layers respectively.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 56 pp. Englisch. Seller Inventory # 9786139442669
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Sometimes social networks frequently require multiple distinct types of connectivity information which can finally be derived as layers. This type of information retrieval can be represented as multi-layer graphs, where each layer contains a set of edges over the same underlying nodes of the base layer. The author proposes two algorithms namely MulCaDu and SoGraM. The first algorithm, MulCaDu represents a call-duration telephone graph as a multi-layer graph. So a total of four layers are generated namely base layer, sublayer-1 (low-call), sublayer-2 (medium-call), and sublayer-3 (high-call) respectively. The second algorithm, SoGraM represents a social graph as a multi-layer graph. For this, the author has chosen three examples of social graph namely Author Graph, Email Graph, and Telephone Graph. So, the Algorithm, SoGraM has successfully represented the Author Graph, Email Graph, and Telephone Graph as multi-layer graphs with three layers, four layers, and five layers respectively. Seller Inventory # 9786139442669
Seller: preigu, Osnabrück, Germany
Taschenbuch. Condition: Neu. Representation of Call-Duration and Social Graph as Multi-Layer Graphs | A Graph Mining Techniques | Bapuji Rao | Taschenbuch | 56 S. | Englisch | 2019 | LAP LAMBERT Academic Publishing | EAN 9786139442669 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. Seller Inventory # 115357489