Filters








23 Hits in 2.5 sec

"Whom-to-interact"

Soumajit Pramanik, Pranay Hasan Yerra, Bivas Mitra
2015 Proceedings of the Second ACM IKDD Conference on Data Sciences - CoDS '15  
Recently, conference publications have gained a wide popularity, specially in the domain of computer science.  ...  In this work, we propose a generic multiplex network framework to uncover the influence of the interactions in a conference on the appearance of the new citation links in future.  ...  We have verified this assumption using the data from the portals of two conferences-CIMTA (Computational Intelligence: Modeling, Techniques and Applications) 2013 and NCC (National Conference on Communications  ... 
doi:10.1145/2732587.2732593 dblp:conf/cods/PramanikYM15 fatcat:hz6t56mx5zbijcfexczxzgx5du

Measuring network centrality using hypergraphs

Sanjukta Roy, Balaraman Ravindran
2015 Proceedings of the Second ACM IKDD Conference on Data Sciences - CoDS '15  
We aim to measure Shapley Value based centrality on these networks without losing the super-dyadic information.  ...  For this purpose, we use co-operative games on single graph representation of a hypergraph such that Shapley value can be computed efficiently[1].  ...  7: Diffusion using linear threshold model on Cora data citation network from Cora Data.  ... 
doi:10.1145/2732587.2732595 dblp:conf/cods/RoyR15 fatcat:3s5hxtwhfrhnbf5q2ron67ueli

Fast approximate dynamic warping kernels

G. Nagendar, C. V. Jawahar
2015 Proceedings of the Second ACM IKDD Conference on Data Sciences - CoDS '15  
data.  ...  There have been attempts in the past to define kernels on DTW distance. These kernels try to approximate the DTW distance.  ...  However, PCA works only on one dimensional data (1D), if we want to apply over two dimensional (2D) data, the 2D data must be transformed into 1D data.  ... 
doi:10.1145/2732587.2732592 dblp:conf/cods/NagendarJ15 fatcat:ssdhffxl5rcbxiel6tqww5yhey

Monotonous (semi-)nonnegative matrix factorization

Nirav Bhatt, Arun Ayyar
2015 Proceedings of the Second ACM IKDD Conference on Data Sciences - CoDS '15  
An algorithm based on alternating least-squares is proposed for recovering monotonous signals from a data matrix.  ...  Further, the assumption on mixing matrix is relaxed to extend monotonous NMF for data matrix with real numbers as entries. The approach is illustrated using synthetic noisy data.  ...  Introduction Nonnegative matrix factorization (NMF) is one of the widely used matrix factorization techniques with application areas ranging from basic sciences such as chemistry, environmental science  ... 
doi:10.1145/2732587.2732600 dblp:conf/cods/BhattA15 fatcat:7tddcrph6jgbxnjmvkeilqoi5e

AMEO 2015

Varun Aggarwal, Shashank Srikant, Harsh Nisar
2016 Proceedings of the 3rd IKDD Conference on Data Science, 2016 - CODS '16  
The data could be used to make an accurate salary predictor, but also understand what influences salary and job titles in the labor market.  ...  Previous studies have shown the influence of various factors such as college reputation, grades, the field one specializes in and market conditions for specific industries.  ...  It was also analyzed as part of two data challenges -at ASSESS 2015 [6] , a workshop on datadriven assessments held at ICDM 2015 and at IKDD CODS 2016 [2] .  ... 
doi:10.1145/2888451.2892037 dblp:conf/cods/AggarwalSN16 fatcat:c2dfxjttsbhc7eiqzxnawnxcha

From multiple views to single view

Subendhu Rongali, A. P. Sarath Chandar, Balaraman Ravindran
2015 Proceedings of the Second ACM IKDD Conference on Data Sciences - CoDS '15  
In [11] , the authors use an autoencoder setup to accomplish Natural Language Processing tasks on bilingual data.  ...  Our goal in this work is to explore the performance of PAE on traditional two-view data and conditionally extend it to cover more views.  ... 
doi:10.1145/2732587.2732602 dblp:conf/cods/RongaliCR15 fatcat:laryexbzlnad3okc4aguhviy3m

A quick algorithm for incremental mining closed frequent itemsets over data streams

Shankar B. Naik, Jyoti D. Pawar
2015 Proceedings of the Second ACM IKDD Conference on Data Sciences - CoDS '15  
The purpose of this work is to mine closed frequent itemsets from transactional data streams using a sliding window model.  ...  The proposed algorithm IMCFI uses a data structure called INdexed Tree(INT) similar to NewCET used in NewMoment [5] .  ...  The 19th International Conference on Management of Data (COMAD), 19 th -21 st Dec, 2013 at Ahmedabad, India. Copyrightc 2013 Computer Society of India (CSI).  ... 
doi:10.1145/2732587.2732611 dblp:conf/cods/NaikP15 fatcat:ayygtt2bhfd35pxupmzwj35eci

A knowledge reuse framework for improving novelty and diversity in recommendations

Apurva Pathak, Bidyut Kr. Patra
2015 Proceedings of the Second ACM IKDD Conference on Data Sciences - CoDS '15  
Classical algorithms in recommender system mainly emphasize on recommendation accuracy in order to match individual user's past profile.  ...  real datasets show that our approach outperfoms stateof-the-art solutions in providing novel and diverse recommended items to individual users and aggregate diversity gain achieved by our approach is on  ...  One main advantage of our reuse framework is that it is immune to data sparsity problem as it does not access the original sparse data.  ... 
doi:10.1145/2732587.2732590 dblp:conf/cods/PathakP15 fatcat:rcdnvrha3jd3hlont22xp4meui

Theme Based Clustering of Tweets

Rudra M. Tripathy, Shashank Sharma, Sachindra Joshi, Sameep Mehta, Amitabha Bagchi
2014 Proceedings of the 1st IKDD Conference on Data Sciences - CoDS '14  
Clustering tweets based on these themes seems a more natural way for grouping.  ...  To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Copyright 20XX ACM X-XXXXX-XX-X/XX/XX ...$10.00.  ...  The measure issue in these studies which make clustering based on bag of words is the Twitter data is sparse, because the tweets are limited to only 140 characters and are not structured.  ... 
doi:10.1145/2567688.2567694 dblp:conf/cods/TripathySJMB14 fatcat:l3egbby5bbai7ng2fzpt3dmsbi

Learning transition models of biological regulatory and signaling networks from noisy data

Deepika Vatsa, Sumeet Agarwal, Ashwin Srinivasan
2016 Proceedings of the 3rd IKDD Conference on Data Science, 2016 - CODS '16  
Experimental results on synthetic data show that noise actually helps in understanding the system dynamics as well as constraining the solution space; thus helping to identify the most probable network  ...  structure for a given data set.  ...  Publication rights licensed to ACM.  ... 
doi:10.1145/2888451.2888469 dblp:conf/cods/VatsaAS16 fatcat:m6tdqziwsfhvho7a472md2jdjy

Pinned it! A Large Scale Study of the Pinterest Network

Sudip Mittal, Neha Gupta, Prateek Dewan, Ponnurangam Kumaraguru
2014 Proceedings of the 1st IKDD Conference on Data Sciences - CoDS '14  
To the best of our knowledge, this is the first attempt to predict gender on Pinterest.  ...  We characterized Pinterest on the basis of large scale crawls of 3.3 million user profiles, and 58.8 million pins.  ...  Online social networks, in general, have been studied in detail by various researchers in the computer science community.  ... 
doi:10.1145/2567688.2567692 dblp:conf/cods/MittalGDK14 fatcat:etolhq7safdf7cyv2i33v6boke

Tracking the conductance of rapidly evolving topic-subgraphs

Sainyam Galhotra, Amitabha Bagchi, Srikanta Bedathur, Maya Ramanath, Vidit Jain
2015 Proceedings of the VLDB Endowment  
ACM IKDD Conference on data sciences, CODS 2015. • Amitabha Bagchi, Cristina M. Pinotti, Sainyam Galhotra. 'Optimal Radius for Connectivity in Duty-Cycled Wireless Sensor Networks'.  ...  • Teaching Assistant: Algorithms for data science (CS590D) at UMass Amherst. • Student Mentor for 2 incoming graduate students at UMass Amherst.  ... 
doi:10.14778/2831360.2831370 fatcat:rhjoreterfbpzcu22n6augj2om

Quasi-Kautz Digraphs for Peer-to-Peer Networks

Deke Guo, Jie Wu, Yunhao Liu, Hai Jin, Hanhua Chen, Tao Chen
2011 IEEE Transactions on Parallel and Distributed Systems  
The Kautz digraph is one of these topologies that have many desirable properties.  ...  In this paper, we propose MOORE: the first effective and practical peer-to-peer network based on the quasi-Kautz digraph with Oðlog d nÞ diameter and constant degree under a dynamic environment.  ...  The work of Deke Guo is supported in part by the National Science  ... 
doi:10.1109/tpds.2010.161 fatcat:y6xfpma5xveu7j4joh6n46daq4

Toward whole-session relevance

Karthik Raman, Paul N. Bennett, Kevyn Collins-Thompson
2013 Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval - SIGIR '13  
. • Showed that performing this splitting based on the NDCG performance of each query can greatly improve performance. • Adding a feedback loop guides you towards a best partitioning of the data for the  ...  Referee Service Conferences Undergraduate and before • All India Rank 34 (out of 300,000 students) in the IIT-JEE Examination (2006) . • All India Rank 4 (out of 500,000 students) in the AIEEE Examination  ... 
doi:10.1145/2484028.2484089 dblp:conf/sigir/RamanBC13 fatcat:7d36xyvelfhffluh6qh3pomyby

Current usage of Component based Principles for Developing Web Applications with Frameworks: A Literature Review

Matija Krznar, Ivan Svogor
2016 Interdisciplinary Description of Complex Systems  
on Next Generation Web Services Practices, NWeSP 2005 IEEE 4 Web3D Symposium Proceedings ACM 5 Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining  ...  ACM 6 Proceedings of the ACM Symposium on Applied Computing ACM 7 Lecture Notes in Computer Science Springer 8 Lecture Notes in Engineering and Computer Science Springer 9 Thirteenth International  ... 
doi:10.7906/indecs.14.2.14 fatcat:osloo7jhbjffzi5pnhl75kj3cm
« Previous Showing results 1 — 15 out of 23 results