Sciweavers

484 search results - page 56 / 97
» Special Track on Data Mining
Sort
View
KDD
2002
ACM
166views Data Mining» more  KDD 2002»
14 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
ICDM
2009
IEEE
117views Data Mining» more  ICDM 2009»
14 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
2007
IEEE
133views Data Mining» more  ICDM 2007»
14 years 2 months ago
Topical N-Grams: Phrase and Topic Discovery, with an Application to Information Retrieval
Most topic models, such as latent Dirichlet allocation, rely on the bag-of-words assumption. However, word order and phrases are often critical to capturing the meaning of text in...
Xuerui Wang, Andrew McCallum, Xing Wei
ICDM
2006
IEEE
138views Data Mining» more  ICDM 2006»
14 years 1 months ago
Belief Propagation in Large, Highly Connected Graphs for 3D Part-Based Object Recognition
We describe a part-based object-recognition framework, specialized to mining complex 3D objects from detailed 3D images. Objects are modeled as a collection of parts together with...
Frank DiMaio, Jude W. Shavlik
KDD
2010
ACM
223views Data Mining» more  KDD 2010»
13 years 9 months ago
An efficient algorithm for a class of fused lasso problems
The fused Lasso penalty enforces sparsity in both the coefficients and their successive differences, which is desirable for applications with features ordered in some meaningful w...
Jun Liu, Lei Yuan, Jieping Ye