Sciweavers

2383 search results - page 9 / 477
» Finding Representative Set from Massive Data
Sort
View
CVPR
2004
IEEE
14 years 8 months ago
Reconstructing Open Surfaces from Unorganized Data Points
In this paper a method for fitting open surfaces to an unorganized set of data points is presented using a level set representation of the surface. This is done by tracking a curv...
Jan Erik Solem, Anders Heyden
ICDM
2006
IEEE
86views Data Mining» more  ICDM 2006»
14 years 23 days ago
Turning Clusters into Patterns: Rectangle-Based Discriminative Data Description
The ultimate goal of data mining is to extract knowledge from massive data. Knowledge is ideally represented as human-comprehensible patterns from which end-users can gain intuiti...
Byron J. Gao, Martin Ester
KDD
2002
ACM
182views Data Mining» more  KDD 2002»
14 years 7 months ago
ANF: a fast and scalable tool for data mining in massive graphs
Graphs are an increasingly important data source, with such important graphs as the Internet and the Web. Other familiar graphs include CAD circuits, phone records, gene sequences...
Christopher R. Palmer, Phillip B. Gibbons, Christo...
ANLP
1997
114views more  ANLP 1997»
13 years 8 months ago
A Workbench for Finding Structure in Texts
In this paper we report on a set of computational tools with (n)SGML pipeline data flow for uncovering internal structure in natural language texts. The main idea behind the workb...
Andrei Mikheev, Steven Finch
PARMA
2004
174views Database» more  PARMA 2004»
13 years 8 months ago
Finding Spatial Patterns in Network Data
Data on modern networks are massive and are applied in the area of monitoring and analyzing activities at the network element, network-wide, and customer and service levels for a h...
Roland Heilmann, Daniel A. Keim, Christian Panse, ...