Essays about: "force-directed"
Showing result 1 - 5 of 12 essays containing the word force-directed.
-
1. Comparing the effect of random and contextual removal of images on object detection performance
University essay from Högskolan i Skövde/Institutionen för informationsteknologiAbstract : As datasets grow, the need for automated methods to ensure dataset quality arises. This report presents an experiment conducted on the MSCOCO train2017 dataset to identify image outliers using a force-directed graph built from a co-occurrence context, focusing on the mean average precision and average precision. READ MORE
-
2. Improving The Visualization And Animation Of Weighted Dynamic Networks Using Force-Directed Graph Drawing Algorithms
University essay from Linköpings universitet/Institutet för analytisk sociologi, IAS; Linköpings universitet/Filosofiska fakultetenAbstract : The visualization of networks as graphs composed of nodes and vertices benefits many fields of science including social network analysis. The use case of visualizations is twofold. Firstly, easy initial visualization of networks will help researchers find and specify their hypotheses before having to do any technical analysis. READ MORE
-
3. Visualization of multi-layered data in node networks
University essay from Lunds universitet/Ergonomi och aerosolteknologiAbstract : Visualization is the discipline of representing information with visual elements. Data structures can benefit from visualization, enabling people deeper understanding of the structures. READ MORE
-
4. Performance Evaluation of JavaScript Rendering Frameworks
University essay from Linköpings universitet/Institutionen för datavetenskapAbstract : When developing interactive web applications a number of different technologies and frameworks could be used. This thesis is set to evaluate a number of popular frameworks that are using different native web rendering techniques. READ MORE
-
5. Comparing the Readability of the Force-Directed and Orthogonal Graph Layout
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : The readability of a graph layout is defined as the efficiency of finding information on that graph, and is measured as the completion time and correctness when performing a task with that layout. Hence, the more readable a layout is, the more efficient a user becomes. READ MORE