Sciweavers

1314 search results - page 131 / 263
» Approximate data mining in very large relational data
Sort
View
DEXA
2007
Springer
154views Database» more  DEXA 2007»
15 years 10 months ago
Performance Oriented Schema Matching
Abstract. Semantic matching of schemas in heterogeneous data sharing systems is time consuming and error prone. Existing mapping tools employ semi-automatic techniques for mapping ...
Khalid Saleem, Zohra Bellahsene, Ela Hunt
PKDD
2010
Springer
179views Data Mining» more  PKDD 2010»
15 years 2 months ago
Laplacian Spectrum Learning
Abstract. The eigenspectrum of a graph Laplacian encodes smoothness information over the graph. A natural approach to learning involves transforming the spectrum of a graph Laplaci...
Pannagadatta K. Shivaswamy, Tony Jebara
CAEPIA
2003
Springer
15 years 9 months ago
Clustering Main Concepts from e-Mails
E–mail is one of the most common ways to communicate, assuming, in some cases, up to 75% of a company’s communication, in which every employee spends about 90 minutes a day in ...
Jesús S. Aguilar-Ruiz, Domingo S. Rodr&iacu...
GIS
2000
ACM
15 years 3 months ago
A conceptual framework for incorporating cognitive principles into geographical database representation
The advancement of GIS data models to allow the eOEective utilization of very large heterogeneous geographic databases requires a new approach that incorporates models of human cog...
Jeremy L. Mennis, Donna Peuquet, Liujian Qian
SYNASC
2006
IEEE
106views Algorithms» more  SYNASC 2006»
15 years 10 months ago
A Quality Measure for Multi-Level Community Structure
Mining relational data often boils down to computing clusters, that is finding sub-communities of data elements forming cohesive sub-units, while being well separated from one an...
Maylis Delest, Jean-Marc Fedou, Guy Melanço...