Sciweavers

1215 search results - page 8 / 243
» Numbers in Multi-relational Data Mining
Sort
View
SDM
2007
SIAM
118views Data Mining» more  SDM 2007»
13 years 10 months ago
On Privacy-Preservation of Text and Sparse Binary Data with Sketches
In recent years, privacy preserving data mining has become very important because of the proliferation of large amounts of data on the internet. Many data sets are inherently high...
Charu C. Aggarwal, Philip S. Yu
AUSDM
2008
Springer
235views Data Mining» more  AUSDM 2008»
13 years 10 months ago
ShrFP-Tree: An Efficient Tree Structure for Mining Share-Frequent Patterns
Share-frequent pattern mining discovers more useful and realistic knowledge from database compared to the traditional frequent pattern mining by considering the non-binary frequen...
Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer,...
KDD
2004
ACM
207views Data Mining» more  KDD 2004»
14 years 8 months ago
SPIN: mining maximal frequent subgraphs from graph databases
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...
Jun Huan, Wei Wang 0010, Jan Prins, Jiong Yang
SIGMOD
2005
ACM
161views Database» more  SIGMOD 2005»
14 years 8 months ago
Building data mining solutions with OLE DB for DM and XML for analysis
A data mining component is included in Microsoft SQL Server 2000 and SQL Server 2005, one of the most popular DBMSs. This gives a push for data mining technologies to move from a ...
ZhaoHui Tang, Jamie Maclennan, Pyungchul (Peter) K...
DMKD
1997
ACM
308views Data Mining» more  DMKD 1997»
14 years 19 days ago
A Fast Clustering Algorithm to Cluster Very Large Categorical Data Sets in Data Mining
Partitioning a large set of objects into homogeneous clusters is a fundamental operation in data mining. The k-means algorithm is best suited for implementing this operation becau...
Zhexue Huang