Selim Mimaroglu
Selim Mimaroglu
Oracle, Data Science Manager
oracle.com üzerinde doğrulanmış e-posta adresine sahip - Ana Sayfa
Başlık
Alıntı yapanlar
Alıntı yapanlar
Yıl
Combining multiple clusterings using similarity graph
S Mimaroglu, E Erdil
Pattern Recognition 44 (3), 694-703, 2011
832011
DICLENS: Divisive clustering ensemble with automatic cluster number
S Mimaroglu, E Aksehirli
IEEE/ACM transactions on computational biology and bioinformatics 9 (2), 408-420, 2011
432011
Improving DBSCAN’s execution time by using a pruning technique on bit vectors
S Mimaroglu, E Aksehirli
Pattern Recognition Letters 32 (13), 1572-1580, 2011
202011
CLICOM: Cliques for combining multiple clusterings
S Mimaroglu, M Yagci
Expert Systems With Applications 39 (2), 1889-1901, 2012
182012
Obtaining better quality final clustering by merging a collection of clusterings
S Mimaroglu, E Erdil
Bioinformatics 26 (20), 2645-2646, 2010
162010
Approximate Computation of Object Distances by Locality-Sensitive Hashing.
S Mimaroglu, DA Simovici
DMIN, 714-718, 2008
162008
An efficient and scalable family of algorithms for combining clusterings
S Mimaroglu, E Erdil
Engineering Applications of Artificial Intelligence 26 (10), 2525-2539, 2013
132013
A binary method for fast computation of inter and intra cluster similarities for combining multiple clusterings
S Mimaroglu, AM Yagci
Proceedings of the 2nd International Conference on Interaction Sciences …, 2009
122009
ASOD: Arbitrary shape object detection
S Mimaroglu, E Erdil
Engineering Applications of Artificial Intelligence 24 (7), 1295-1299, 2011
112011
Bit sequences and biclustering of text documents
S Mimaroglu, K Uehara
Seventh IEEE International Conference on Data Mining Workshops (ICDMW 2007 …, 2007
72007
Clustering and Approximate Identification of Frequent Item Sets.
S Mimaroglu, DA Simovici
FLAIRS Conference, 502-506, 2007
62007
Approximative distance computation by random hashing
S Mimaroglu, M Yagci, DA Simovici
The Journal of Supercomputing 61 (3), 572-589, 2012
22012
Mining Approximate Descriptions Using Rough Sets and Genetic Algorithms.
S Mimaroglu
Journal of Multiple-Valued Logic & Soft Computing 20, 2013
12013
Mining frequent item sets efficiently by using compression techniques
S Mimaroglu, C Cubukcu, E Aksehirli, E Erdil
Proceedings of the International Conference on Data Science (ICDATA), 1, 2011
12011
Mining Approximative Descriptions of Sets Using Rough Sets
DA Simovici, S Mimaroglu
2009 39th International Symposium on Multiple-Valued Logic, 66-71, 2009
12009
A Boolean Approach for Detection of Frequent Items
D Simovici, R Sizov, S Mimaroglu
19th International Symposium on Symbolic and Numeric Algorithms for …, 2017
2017
Binary Sequences and Association Graphs for Fast Detection of Sequential Patterns.
S Mimaroglu, DA Simovici
EGC, 355-360, 2009
2009
Binary methods in data mining
SN Mimaroglu
Office of Graduate Studies, University of Massachusetts Boston, 2008
2008
Insert-Friendly Hierarchical Numbering Schemes for XML
T Böhme, S Mimaroglu, E O’Neil, P O’Neil, E Rahm
Sistem, işlemi şu anda gerçekleştiremiyor. Daha sonra yeniden deneyin.
Makaleler 1–19