Sciweavers

1314 search results - page 12 / 263
» Approximate data mining in very large relational data
Sort
View
ICDM
2008
IEEE
136views Data Mining» more  ICDM 2008»
14 years 1 months ago
Generalized Framework for Syntax-Based Relation Mining
Supervised approaches to Data Mining are particularly appealing as they allow for the extraction of complex relations from data objects. In order to facilitate their application i...
Bonaventura Coppola, Alessandro Moschitti, Daniele...
ICDIM
2008
IEEE
14 years 1 months ago
A fast approximate algorithm for large-scale Latent Semantic Indexing
Latent Semantic Indexing (LSI) is an effective method to discover the underlying semantic structure of data. It has numerous applications in information retrieval and data mining....
Dell Zhang, Zheng Zhu
SDM
2003
SIAM
129views Data Mining» more  SDM 2003»
13 years 8 months ago
Approximate Query Answering by Model Averaging
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...
Dmitry Pavlov, Padhraic Smyth
ICDM
2008
IEEE
222views Data Mining» more  ICDM 2008»
14 years 1 months ago
GRAPHITE: A Visual Query System for Large Graphs
We present Graphite, a system that allows the user to visually construct a query pattern, finds both its exact and approximate matching subgraphs in large attributed graphs, and ...
Duen Horng Chau, Christos Faloutsos, Hanghang Tong...
COLING
2010
13 years 2 months ago
Enhancing Cross Document Coreference of Web Documents with Context Similarity and Very Large Scale Text Categorization
Cross Document Coreference (CDC) is the task of constructing the coreference chain for mentions of a person across a set of documents. This work offers a holistic view of using do...
Jian Huang 0002, Pucktada Treeratpituk, Sarah M. T...