Sciweavers

2383 search results - page 144 / 477
» Finding Representative Set from Massive Data
Sort
View
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
14 years 9 months ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon
KDD
2007
ACM
122views Data Mining» more  KDD 2007»
16 years 6 months ago
Expertise modeling for matching papers with reviewers
An essential part of an expert-finding task, such as matching reviewers to submitted papers, is the ability to model the expertise of a person based on documents. We evaluate seve...
David M. Mimno, Andrew McCallum
BMCBI
2004
111views more  BMCBI 2004»
15 years 6 months ago
Multiclass discovery in array data
Background: A routine goal in the analysis of microarray data is to identify genes with expression levels that correlate with known classes of experiments. In a growing number of ...
Yingchun Liu, Markus Ringnér
WIRI
2005
IEEE
15 years 12 months ago
Mapping generation for XML data sources: a general framework
The inter-operability of multiple autonomous and heterogeneous data sources is an important issue in many applications such as mediation systems, datawarehouses, or web-based syst...
Zoubida Kedad, Xiaohui Xue
IV
2002
IEEE
104views Visualization» more  IV 2002»
15 years 11 months ago
An Environment for Studying the Impact of Spatialising Sonified Graphs on Data Comprehension
We describe AudioCave, an environment for exploring the impact of spatialising sonified graphs on a set of numerical data comprehension tasks. Its design builds on findings regard...
Rameshsharma Ramloll, Stephen A. Brewster