Name
Title | ||
|---|---|---|
Low-Rank matrix factorization and co-clustering algorithms for analyzing large data sets |
Abstract | ||
|---|---|---|
With the ever increasing data, there is a greater need for analyzing and extracting useful and meaningful information out of it. The amount of research being conducted in extracting this information is commendable. From clustering to bi and multi clustering, there are a lot of different algorithms proposed to analyze and discover the hidden patterns in data, in every which way possible. On the other hand, the size of the data sets is increasing with each passing day and hence it is becoming increasingly difficult to try and analyze all this data and find clusters in them without the algorithms being computationally prohibitive. In this study, we have tried to study both the domains and understand the development of the algorithms and how they are being used. We have compared the different algorithms to try and get a better idea of which algorithm is more suited for a particular situation. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/978-3-642-27872-3_41 | ICDEM |
Keywords | Field | DocType |
different algorithm,meaningful information,large data set,multi clustering,greater need,low-rank matrix factorization,particular situation,hidden pattern,better idea,co-clustering algorithm,co clustering,matrix factorization | Data mining,Fuzzy clustering,CURE data clustering algorithm,Computer science,Artificial intelligence,Biclustering,Cluster analysis,Canopy clustering algorithm,Data stream clustering,Correlation clustering,Algorithm,Constrained clustering,Machine learning | Conference |
Citations | PageRank | References |
2 | 0.38 | 7 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Archana Donavalli | 1 | 2 | 0.38 |
| Manjeet Rege | 2 | 264 | 17.25 |
| Xumin Liu | 3 | 471 | 34.87 |
| kourosh jafarikhouzani | 4 | 261 | 28.87 |