Sciweavers

2656 search results - page 89 / 532
» Compacting XML Data
Sort
View
128
Voted
SDM
2007
SIAM
143views Data Mining» more  SDM 2007»
15 years 4 months ago
Less is More: Compact Matrix Decomposition for Large Sparse Graphs
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...
Jimeng Sun, Yinglian Xie, Hui Zhang, Christos Falo...
INFOVIS
2002
IEEE
15 years 7 months ago
Beamtrees: Compact Visualization of Large Hierarchies
Beamtrees are a new method for the visualization of large hierarchical data sets. Nodes are shown as stacked circular beams, such that both the hierarchical structure as well as t...
Frank van Ham, Jarke J. van Wijk
104
Voted
KDD
2003
ACM
116views Data Mining» more  KDD 2003»
16 years 3 months ago
XRules: an effective structural classifier for XML data
XML documents have recently become ubiquitous because of their varied applicability in a number of applications. Classification is an important problem in the data mining domain, ...
Mohammed Javeed Zaki, Charu C. Aggarwal
131
Voted
VLDB
2002
ACM
106views Database» more  VLDB 2002»
15 years 2 months ago
Structure and Value Synopses for XML Data Graphs
All existing proposals for querying XML (e.g., XQuery) rely on a pattern-specification language that allows (1) path navigation and branching through the label structure of the XM...
Neoklis Polyzotis, Minos N. Garofalakis
WWW
2009
ACM
16 years 3 months ago
Interactive search in XML data
In a traditional keyword-search system in XML data, a user composes a keyword query, submits it to the system, and retrieves relevant subtrees. In the case where the user has limi...
Guoliang Li, Jianhua Feng, Lizhu Zhou