Sciweavers

1599 search results - page 97 / 320
» Theoretical Frameworks for Data Mining
Sort
View
KDD
2012
ACM
187views Data Mining» more  KDD 2012»
13 years 9 days ago
Unsupervised feature selection for linked social media data
The prevalent use of social media produces mountains of unlabeled, high-dimensional data. Feature selection has been shown effective in dealing with high-dimensional data for eď¬...
Jiliang Tang, Huan Liu
ICDM
2003
IEEE
99views Data Mining» more  ICDM 2003»
15 years 3 months ago
Scalable Model-based Clustering by Working on Data Summaries
The scalability problem in data mining involves the development of methods for handling large databases with limited computational resources. In this paper, we present a two-phase...
Huidong Jin, Man Leung Wong, Kwong-Sak Leung
ACMSE
2010
ACM
14 years 8 months ago
Mining relaxed closed subspace clusters
This paper defines and discusses a new problem in the area of subspace clustering. It defines the problem of mining closed subspace clusters. This new concept allows for the culli...
Erich Allen Peterson, Peiyi Tang
TKDE
2012
270views Formal Methods» more  TKDE 2012»
13 years 8 days ago
Low-Rank Kernel Matrix Factorization for Large-Scale Evolutionary Clustering
—Traditional clustering techniques are inapplicable to problems where the relationships between data points evolve over time. Not only is it important for the clustering algorith...
Lijun Wang, Manjeet Rege, Ming Dong, Yongsheng Din...
ECIS
2003
14 years 11 months ago
Implementing inter-organizational systems (IOS) for strategic advantage: a value-flow framework
Increasingly, organizations have been investing heavily in information systems for greater dyadic coordination and cooperation with each of their key business partners. In this re...
Michael T. K. Tan, K. S. Raman, Kwok Kee Wei