Sciweavers

2764 search results - page 547 / 553
» Information Retrieval by Semantic Similarity
Sort
View
KDD
2004
ACM
136views Data Mining» more  KDD 2004»
14 years 8 months ago
A cross-collection mixture model for comparative text mining
In this paper, we define and study a novel text mining problem, which we refer to as Comparative Text Mining (CTM). Given a set of comparable text collections, the task of compara...
ChengXiang Zhai, Atulya Velivelli, Bei Yu
SIGMOD
2001
ACM
184views Database» more  SIGMOD 2001»
14 years 7 months ago
Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....
Eamonn J. Keogh, Kaushik Chakrabarti, Sharad Mehro...
ICIDS
2009
Springer
14 years 2 months ago
Say Anything: A Demonstration of Open Domain Interactive Digital Storytelling
Say Anything is a text-based interactive digital storytelling application that differs from other systems in its emphasis on the ability of users to create a narrative in any domai...
Reid Swanson, Andrew S. Gordon
IDEAL
2007
Springer
14 years 1 months ago
Topological Tree Clustering of Social Network Search Results
In the information age, online collaboration and social networks are of increasing importance and quickly becoming an integral part of our lifestyle. In business, social networking...
Richard T. Freeman
PKDD
2005
Springer
188views Data Mining» more  PKDD 2005»
14 years 1 months ago
Elastic Partial Matching of Time Series
We consider a problem of elastic matching of time series. We propose an algorithm that automatically determines a subsequence b of a target time series b that best matches a query ...
Longin Jan Latecki, Vasilis Megalooikonomou, Qiang...