检索结果-内蒙古大学图书馆

International Joint conference on Neural Networks (IJCNN)

作者： Cabanes, Guenael Bennani, Younes LIPN CNRS UMR 7030 F-94340 Villetaneuse France

ISBN: (纸本)9781424496365

The exponential growth of data generates terabytes of very large databases. The growing number of data dimensions and data objects presents tremendous challenges for effective data analysis and data exploration methods and tools. One solution commonly proposed is the use of a condensed description of the properties and structure of data. Thus, it becomes crucial to have visualization tools capable of representing the data structure, not from the data themselves, but from these condensed descriptions. The purpose of our work described in this paper is to develop and put a synergistic visualization of data and knowledge into the knowledge discovery process. We propose here a method of describing data from enriched and segmented prototypes using a clustering algorithm. We then introduce a visualization tool that can enhance the structure within and between groups in data. We show, using some artificial and real databases, the relevance of the proposed method.

关键词： Clustering algorithms data structures data visualization databases Density functional theory Neurons Prototypes data analysis data clustering data exploration data mining data visualisation database database management systems exponential data growth knowledge discovery pattern clustering self-organising feature maps synergistic data visualization visualization tool

来源：评论

学校读者我要写书评

暂无评论

Unifying the Integration, analysis and Interpretation of multi-omic datasets: Exploration of the disease networks of Obstructive Nephropathy in children

Unifying the Integration, Analysis and Interpretation of mul...

引用

33rd Annual International conference of the IEEE Engineering-in-Medicine-and-Biology-Society (EMBS)

作者： Moulos, Panagiotis Valavanis, Ioannis Klein, Julie Maglogiannis, Ilias Schanstra, Joost Chatziioannou, Aristotelis Natl Hellen Res Fdn Inst Biol Res & Biotechnol Athens Greece

ISBN: (纸本)9781424441228

The wealth of data amassed by the utilization of various high-throughput techniques, in various layers of molecular dissection, stresses the critical role of the unification of the computational methodologies applied in biological data handling, storage, analysis and visualization. In this article, a generic workflow is showcased in a multi-omic dataset that is used to study Obstructive Nephropathy (ON) in children, integrating microarray data from several biological layers (transcriptomic, post-transcriptomic, proteomic). The workflow exploits raw measurements and through several analytical stages (preprocessing, statistical and functional), which entail various parsing steps, reaches the visualization stage of the heterogeneous, broader, molecular interacting network derived. This network, where the interconnected entities are exploiting the knowledge stored in public repositories, represents a systems level interpretation of the pathological state probed.

关键词： Bioinformatics data visualization Genomics Mice Proteins Proteomics bioinformatics biological data analysis biological data handling biological data storage biological data visualization biological techniques biomedical engineering complex networks comput

来源：评论

学校读者我要写书评

暂无评论

A Knowledge visualization of database Content Created By A database Taxonomy

A Knowledge Visualization of Database Content Created By A D...

引用

15th International conference on Information Visualisation (IV)

作者： Zellweger, H. Paul ArborWay Labs Rochester MN USA

ISBN: (纸本)9780769544762

The synergy between information visualization and knowledge visualization is explored using the "database Taxonomy" to guide the way. Drawing extensively on Burgin's mathematical theory of named sets, this new knowledge visualization treats all database content as if it were scientific data, regardless of the database application. This mathematical tool penetrates deep into the logical structure of data and data relations, enabling a single algorithm to generate a conceptual knowledge structure, which pre-structures raw data in the database into a list of nested data-topic lists that works like a book index. For end-users, this visualization is familiar, convenient and precise. For the research community, this knowledge structure and the techniques used to build it offer an empirical tool for investigating the underlying properties of data, information, and knowledge on a computing device. The transformation from data to information to knowledge is automatic and seamless, thanks to a novel analysis of the logical structure of the symbols on these mechanical devices, one which reveals meta-symbols consisting of physical values (v) and constructed-types (t). The database Taxonomy also provides a first glimpse into how navigating this structure can generate a predicate logic expression, an outcome which the author believes promises to advance our theoretical understanding of knowledge visualization and of the influence of a digital media on symbolic logic.

关键词： database navigation knowledge visualization RDBMS interface

来源：评论

学校读者我要写书评

暂无评论

visualization of Topological Structures in Area-Preserving Maps

引用

IEEE TRANSACTIONS ON visualization AND COMPUTER GRAPHICS 2011年第12期17卷 1765-1774页

作者： Tricoche, Xavier Garth, Christoph Sanderson, Allen Purdue Univ W Lafayette IN 47907 USA Univ Calif Davis Davis CA 95616 USA Univ Kaiserslautern D-67663 Kaiserslautern Germany Univ Utah SCI Inst Salt Lake City UT 84112 USA

Area-preserving maps are found across a wide range of scientific and engineering problems. Their study is made challenging by the significant computational effort typically required for their inspection but more fundamentally by the fractal complexity of salient structures. The visual inspection of these maps reveals a remarkable topological picture consisting of fixed (or periodic) points embedded in so-called island chains, invariant manifolds, and regions of ergodic behavior. This paper is concerned with the effective visualization and precise topological analysis of area-preserving maps with two degrees of freedom from numerical or analytical data. Specifically, a method is presented for the automatic extraction and characterization of fixed points and the computation of their invariant manifolds, also known as separatrices, to yield a complete picture of the structures present within the scale and complexity bounds selected by the user. This general approach offers a significant improvement over the visual representations that are so far available for area-preserving maps. The technique is demonstrated on a numerical simulation of magnetic confinement in a fusion reactor.

关键词： Poincare map dynamical systems topology chaos area-preserving maps invariant manifolds

来源：评论

学校读者我要写书评

暂无评论

Preference-Based datacube analysis with MYOLAP

Preference-Based Datacube Analysis with MYOLAP

引用

IEEE 27th International conference on data Engineering (ICDE 2011)

作者： Biondi, Paolo Golfarelli, Matteo Rizzi, Stefano Univ Bologna DEIS Bologna Italy

ISBN: (纸本)9781424489589

In this demonstration we present MYOLAP, a Java-based tool that allows OLAP analyses to be personalized and enhanced by expressing "soft" query constraints in the form of user preferences. MYOLAP is based on a novel preference algebra and a preference evaluation algorithm specifically devised for the OLAP domain. Preferences are formulated either visually or through an extension of the MDX language, and user interaction with the results is mediated by a visual graph-like structure that shows better-than relationships between different sets of data. The demonstration will show how analysis sessions can benefit from coupling ad-hoc preference constructors with the classical OLAP operators, and in particular how MYOLAP supports users in expressing preference queries, analyzing their results, and navigating datacubes.

关键词： Algebra data structures data visualization databases Economics Java-based tool MDX language MYOLAP Navigation visualization data analysis data mining preference algebra preference evaluation algorithm preference queries preference-based datacube analysis query processing soft query constraints visual graph-like structure

来源：评论

学校读者我要写书评

暂无评论

Evaluation of Traditional, Orthogonal, and Radial Tree Diagrams by an Eye Tracking Study

引用

IEEE TRANSACTIONS ON visualization AND COMPUTER GRAPHICS 2011年第12期17卷 2440-2448页

作者： Burch, Michael Heinrich, Julian Konevtsova, Natalia Hoeferlin, Markus Weiskopf, Daniel Univ Stuttgart VISUS D-7000 Stuttgart Germany

Node-link diagrams are an effective and popular visualization approach for depicting hierarchical structures and for showing parent-child relationships. In this paper, we present the results of an eye tracking experiment investigating traditional, orthogonal, and radial node-link tree layouts as a piece of empirical basis for choosing between those layouts. Eye tracking was used to identify visual exploration behaviors of participants that were asked to solve a typical hierarchy exploration task by inspecting a static tree diagram: finding the least common ancestor of a given set of marked leaf nodes. To uncover exploration strategies, we examined fixation points, duration, and saccades of participants' gaze trajectories. For the non-radial diagrams, we additionally investigated the effect of diagram orientation by switching the position of the root node to each of the four main orientations. We also recorded and analyzed correctness of answers as well as completion times in addition to the eye movement data. We found out that traditional and orthogonal tree layouts significantly outperform radial tree layouts for the given task. Furthermore, by applying trajectory analysis techniques we uncovered that participants cross-checked their task solution more often in the radial than in the non-radial layouts.

关键词： Hierarchy visualization node-link layout eye tracking user study

来源：评论

学校读者我要写书评

暂无评论

引用

IEEE TRANSACTIONS ON visualization AND COMPUTER GRAPHICS 2011年第12期17卷 2459-2468页

作者： Paiva, Jose Gustavo S. Florian-Cruz, Laura Pedrini, Helio Telles, Guilherme P. Minghim, Rosane Univ Fed Uberlandia Uberlandia MG Brazil Univ Sao Paulo ICMC BR-05508 Sao Paulo Brazil Univ Estadual Campinas IC Campinas SP Brazil

An alternative form to multidimensional projections for the visual analysis of data represented in multidimensional spaces is the deployment of similarity trees, such as Neighbor Joining trees. They organize data objects on the visual plane emphasizing their levels of similarity with high capability of detecting and separating groups and subgroups of objects. Besides this similarity-based hierarchical data organization, some of their advantages include the ability to decrease point clutter;high precision;and a consistent view of the data set during focusing, offering a very intuitive way to view the general structure of the data set as well as to drill down to groups and subgroups of interest. Disadvantages of similarity trees based on neighbor joining strategies include their computational cost and the presence of virtual nodes that utilize too much of the visual space. This paper presents a highly improved version of the similarity tree technique. The improvements in the technique are given by two procedures. The first is a strategy that replaces virtual nodes by promoting real leaf nodes to their place, saving large portions of space in the display and maintaining the expressiveness and precision of the technique. The second improvement is an implementation that significantly accelerates the algorithm, impacting its use for larger data sets. We also illustrate the applicability of the technique in visual data mining, showing its advantages to support visual classification of data sets, with special attention to the case of image classification. We demonstrate the capabilities of the tree for analysis and iterative manipulation and employ those capabilities to support evolving to a satisfactory data organization and classification.

关键词： Similarity Trees Multidimensional Projections Image Classification

来源：评论

学校读者我要写书评

暂无评论

Development of analysis CRM in Enterprise Based on Association Rules Mining

Development of Analysis CRM in Enterprise Based on Associati...

引用

2011 International conference on Photonics, 3D-Imaging, and visualization

作者： Lan Wang Hong Sheng Xu Academy of Information Technology Luoyang Normal University

ISBN: (纸本)9780819488473

data Mining have many research points. Mining association rules is one of the important hotspot. CRM is to achieve the needs of customers and to enhance the strength with customers for enterprise. To sovle the different importance and unbalance of individual items in database, the paper will put the emphasis on mining the weighted association rules in analysis CRM. analysis CRM in axletree firms is proposed based on integrating of data mining and association rules. This paper propose the algorithm UnidTP-TREE for frequent itemset in a unidirectional FTP-Tree. Algorithm analysis and experiments show that the UnidTP-TREE consumes more space and time than the mwf for the dense data.

关键词： customer relationship management(CRM) association rule data mining

来源：评论

学校读者我要写书评

暂无评论

Multiresolution Semantic visualization of Network Traffic

Multiresolution Semantic Visualization of Network Traffic

引用

5th Annual IEEE International conference on Semantic Computing (ICSC)

作者： Hussain, Alefiya Viswanathan, Arun USC Informat Sci Inst Los Angeles CA 90007 USA

ISBN: (纸本)9780769544922

Multiresolution semantic analysis of data involves inferring increasing levels of meaning from data. Due to the large volume and complexity of network data, multiresolution visualizations allow the user to rapidly focus on meaningful and relevant information. Current tools and techniques for visual analysis of network data are limited in their ability to operate at semantically relevant resolutions and impose great cognitive burden on users to manually infer semantics from low-level details. Extending our previous work that allows users to define semantics as abstract models, we apply these models to construct multiresolution visualizations of network traffic data. Our methodology for visual exploration allows the user to rapidly analyze and understand network traces, by providing intuitive and interactive representations of the network. We demonstrate the effectiveness of our approach by applying it to analyzing network trace data from a cyber security incident involving DNS cache poisoning.

关键词： Analytical models Computer crime data visualization Semantics Spatial resolution visualization networks security visualization

来源：评论

学校读者我要写书评

暂无评论

Multivariate data visualization via Outdoor Scenes

Multivariate Data Visualization via Outdoor Scenes

引用

conference on visualization and data analysis 2011

作者： Hillery, Benjamin A. Burton, Robert P. Brigham Young Univ Provo UT 84602 USA

ISBN: (纸本)9780819484055

visualization of multivariate data presents a challenge due to the sheer dimensionality and density of information. When presenting the data symbolically, this high information dimensionality and density makes it difficult to develop a symbology capable of displaying it in a single presentation. One approach to multivariate visualization involves creating symbols with higher dimensionality. Higher dimensional symbols can be problematic, since they typically require significant human attentive processing to interpret, offsetting their greater informational capacity. Although attempts have been made to develop higher-dimensional symbols that are processed in a preattentive fashion, success has proven elusive. Recent cognitive research indicates that outdoor scenes are processed in a preattentive manner. We evaluate outdoor scenes as a candidate for developing an effective higher-dimensional symbology by generating proof-of-concept images and comparing them to related methods.

关键词： visualization data visualization Brain Visual system Facial recognition systems Computer programming data processing Functional magnetic resonance imaging Retina Vegetation

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：