Sciweavers

143 search results - page 4 / 29
» Mining Thick Skylines over Large Databases
Sort
View
ICDE
2009
IEEE
290views Database» more  ICDE 2009»
14 years 7 months ago
GraphSig: A Scalable Approach to Mining Significant Subgraphs in Large Graph Databases
Graphs are being increasingly used to model a wide range of scientific data. Such widespread usage of graphs has generated considerable interest in mining patterns from graph datab...
Sayan Ranu, Ambuj K. Singh
KDD
2008
ACM
120views Data Mining» more  KDD 2008»
14 years 5 months ago
Entity categorization over large document collections
Extracting entities (such as people, movies) from documents and identifying the categories (such as painter, writer) they belong to enable structured querying and data analysis ov...
Arnd Christian König, Rares Vernica, Venkates...
IJCSA
2008
108views more  IJCSA 2008»
13 years 5 months ago
Consistency Check Algorithms for Multi-Dimensional Preference Trade-Offs
: Skyline Queries have recently received a lot of attention due to their intuitive query capabilities. Following the concept of Pareto optimality all `best' database objects a...
Christoph Lofi, Wolf-Tilo Balke, Ulrich Güntz...
IEAAIE
2009
Springer
13 years 12 months ago
An Efficient Algorithm for Maintaining Frequent Closed Itemsets over Data Stream
Data mining refers to the process of revealing unknown and potentially useful information from a large database. Frequent itemsets mining is one of the foundational problems in dat...
Show-Jane Yen, Yue-Shi Lee, Cheng-Wei Wu, Chin-Lin...
KDD
2004
ACM
207views Data Mining» more  KDD 2004»
14 years 5 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