Sciweavers

12863 search results - page 977 / 2573
» Dynamic Data Mining
Sort
View
KDD
2002
ACM
166views Data Mining» more  KDD 2002»
16 years 8 months ago
Frequent term-based text clustering
Text clustering methods can be used to structure large sets of text or hypertext documents. The well-known methods of text clustering, however, do not really address the special p...
Florian Beil, Martin Ester, Xiaowei Xu
KDD
2002
ACM
125views Data Mining» more  KDD 2002»
16 years 8 months ago
Pattern discovery in sequences under a Markov assumption
In this paper we investigate the general problem of discovering recurrent patterns that are embedded in categorical sequences. An important real-world problem of this nature is mo...
Darya Chudova, Padhraic Smyth
KDD
2002
ACM
184views Data Mining» more  KDD 2002»
16 years 8 months ago
The Community of Multimedia Agents
Multimedia data mining requires the ability to automatically analyze and understand the content. The Community of Multimedia Agents project is devoted to creating a community of re...
Gang Wei, Valery A. Petrushin, Anatole Gershman
ICDM
2009
IEEE
117views Data Mining» more  ICDM 2009»
16 years 2 months ago
Redistricting Using Heuristic-Based Polygonal Clustering
— Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too comple...
Deepti Joshi, Leen-Kiat Soh, Ashok Samal
ICDM
2009
IEEE
168views Data Mining» more  ICDM 2009»
16 years 2 months ago
Bi-relational Network Analysis Using a Fast Random Walk with Restart
—Identification of nodes relevant to a given node in a relational network is a basic problem in network analysis with great practical importance. Most existing network analysis ...
Jing Xia, Doina Caragea, William H. Hsu