Sciweavers

1314 search results - page 14 / 263
» Approximate data mining in very large relational data
Sort
View
IS
2008
13 years 7 months ago
Mining relational data from text: From strictly supervised to weakly supervised learning
This paper approaches the relation classification problem in information extraction framework with different machine learning strategies, from strictly supervised to weakly superv...
Zhu Zhang
CORR
2010
Springer
138views Education» more  CORR 2010»
13 years 7 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
KDD
1998
ACM
107views Data Mining» more  KDD 1998»
13 years 11 months ago
Giga-Mining
Wedescribe an industrial-strength data mining application in telecommunications.Theapplication requires building a short (7 byte) profile for all telephonenumbersseen on a large t...
Corinna Cortes, Daryl Pregibon
LSSC
2001
Springer
13 years 11 months ago
On the Parallelization of the Sparse Grid Approach for Data Mining
Abstract. Recently we presented a new approach [5, 6] to the classification problem arising in data mining. It is based on the regularization network approach, but in contrast to ...
Jochen Garcke, Michael Griebel
DATAMINE
2006
176views more  DATAMINE 2006»
13 years 7 months ago
A Bit Level Representation for Time Series Data Mining with Shape Based Similarity
Clipping is the process of transforming a real valued series into a sequence of bits representing whether each data is above or below the average. In this paper, we argue that clip...
Anthony J. Bagnall, Chotirat (Ann) Ratanamahatana,...