Sciweavers

438 search results - page 57 / 88
» Data Structure and Algorithm in Data Mining: Granular Comput...
Sort
View
CIKM
2005
Springer
14 years 2 months ago
Maximal termsets as a query structuring mechanism
Search engines process queries conjunctively to restrict the size of the answer set. Further, it is not rare to observe a mismatch between the vocabulary used in the text of Web p...
Bruno Pôssas, Nivio Ziviani, Berthier A. Rib...
ICDE
2008
IEEE
141views Database» more  ICDE 2008»
14 years 10 months ago
A General Framework for Fast Co-clustering on Large Datasets Using Matrix Decomposition
Abstract-- Simultaneously clustering columns and rows (coclustering) of large data matrix is an important problem with wide applications, such as document mining, microarray analys...
Feng Pan, Xiang Zhang, Wei Wang 0010
IS
2007
13 years 8 months ago
Discovering frequent geometric subgraphs
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...
Michihiro Kuramochi, George Karypis
ADC
2009
Springer
175views Database» more  ADC 2009»
14 years 3 months ago
Conditional Purpose Based Access Control Model for Privacy Protection
This paper presents a model for privacy preserving access control which is based on variety of purposes. Conditional purpose is applied along with allowed purpose and prohibited p...
Md. Enamul Kabir, Hua Wang
CORR
2010
Springer
173views Education» more  CORR 2010»
13 years 8 months ago
CONCISE: Compressed 'n' Composable Integer Set
Bit arrays, or bitmaps, are used to significantly speed up set operations in several areas, such as data warehousing, information retrieval, and data mining, to cite a few. Howeve...
Alessandro Colantonio, Roberto Di Pietro