Sciweavers

555 search results - page 51 / 111
» An Empirical Study on Web Mining of Parallel Data
Sort
View
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
15 years 10 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye
ICWS
2009
IEEE
15 years 7 months ago
Service-Oriented Architecture for Privacy-Preserving Data Mashup
Mashup is a web technology that combines information from more than one source into a single web application. This technique provides a new platform for different data providers t...
Thomas Trojer, Benjamin C. M. Fung, Patrick C. K. ...
PAMI
2011
14 years 4 months ago
Parallel Spectral Clustering in Distributed Systems
Spectral clustering algorithms have been shown to be more effective in finding clusters than some traditional algorithms such as k-means. However, spectral clustering suffers fro...
Wen-Yen Chen, Yangqiu Song, Hongjie Bai, Chih-Jen ...
ICDM
2006
IEEE
98views Data Mining» more  ICDM 2006»
15 years 3 months ago
What is the Dimension of Your Binary Data?
Many 0/1 datasets have a very large number of variables; however, they are sparse and the dependency structure of the variables is simpler than the number of variables would sugge...
Nikolaj Tatti, Taneli Mielikäinen, Aristides ...
CW
2005
IEEE
15 years 3 months ago
Data Integration for Virtual Enterprise in Cyberworlds
Virtual Enterprise enables companies to collaborate through sharing of resources, and therefore allows them to enjoy the benefits of virtual integration. The essence of Virtual En...
Cheng Leong Ang, Robert Kheng Leng Gay, Olga Souri...