Sciweavers

1768 search results - page 45 / 354
» Mining Very Large Databases
Sort
View
KDD
2002
ACM
136views Data Mining» more  KDD 2002»
14 years 10 months ago
Relational Markov models and their application to adaptive web navigation
Relational Markov models (RMMs) are a generalization of Markov models where states can be of different types, with each type described by a different set of variables. The domain ...
Corin R. Anderson, Pedro Domingos, Daniel S. Weld
PVLDB
2010
135views more  PVLDB 2010»
13 years 8 months ago
Similarity Search and Mining in Uncertain Databases
Managing, searching and mining uncertain data has achieved much attention in the database community recently due to new sensor technologies and new ways of collecting data. There ...
Matthias Renz, Reynold Cheng, Hans-Peter Kriegel, ...
KDD
2002
ACM
138views Data Mining» more  KDD 2002»
14 years 10 months ago
Learning to match and cluster large high-dimensional data sets for data integration
Part of the process of data integration is determining which sets of identifiers refer to the same real-world entities. In integrating databases found on the Web or obtained by us...
William W. Cohen, Jacob Richman
CORR
2010
Springer
138views Education» more  CORR 2010»
13 years 10 months ago
Data Stream Clustering: Challenges and Issues
Very large databases are required to store massive amounts of data that are continuously inserted and queried. Analyzing huge data sets and extracting valuable pattern in many appl...
Madjid Khalilian, Norwati Mustapha
ITICSE
2004
ACM
14 years 3 months ago
Use of large databases for group projects at the nexus of teaching and research
Final year, group (capstone) projects in computing disciplines are often expected to fill multiple roles: in addition to allowing students to learn important domain-specific knowl...
Richard C. Thomas, Rebecca Mancy