Sciweavers

732 search results - page 110 / 147
» Efficient Frequent Pattern Mining in Relational Databases
Sort
View
ICDE
2003
IEEE
170views Database» more  ICDE 2003»
14 years 9 months ago
Keyword Proximity Search on XML Graphs
XKeyword provides efficient keyword proximity queries on large XML graph databases. A query is simply a list of keywords and does not require any schema or query language knowledg...
Vagelis Hristidis, Yannis Papakonstantinou, Andrey...
VLDB
1998
ACM
180views Database» more  VLDB 1998»
13 years 12 months ago
Active Storage for Large-Scale Data Mining and Multimedia
The increasing performance and decreasing cost of processors and memory are causing system intelligence to move into peripherals from the CPU. Storage system designers are using t...
Erik Riedel, Garth A. Gibson, Christos Faloutsos
GIS
2008
ACM
14 years 8 months ago
Mining user similarity based on location history
The pervasiveness of location-acquisition technologies (GPS, GSM networks, etc.) enable people to conveniently log the location histories they visited with spatio-temporal data. T...
Quannan Li, Yu Zheng, Xing Xie, Yukun Chen, Wenyu ...
PKDD
2007
Springer
143views Data Mining» more  PKDD 2007»
14 years 1 months ago
Using the Web to Reduce Data Sparseness in Pattern-Based Information Extraction
Textual patterns have been used effectively to extract information from large text collections. However they rely heavily on textual redundancy in the sense that facts have to be m...
Sebastian Blohm, Philipp Cimiano
DKE
2002
218views more  DKE 2002»
13 years 7 months ago
Computing iceberg concept lattices with T
We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suit...
Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas P...