Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Seema Nagar is active.

Publication


Featured researches published by Seema Nagar.


conference on information and knowledge management | 2009

User interests in social media sites: an exploration with micro-blogs

Nilanjan Banerjee; Dipanjan Chakraborty; Koustuv Dasgupta; Sumit Mittal; Anupam Joshi; Seema Nagar; Angshu Rai; Sameer Madan

Recent technological advances in mobile-based access to social networking platforms and facilities to update information in real{time (e.g. in Facebook) have allowed an individuals online presence to be as ephemeral and dynamic in nature, as her very thoughts and interests. In this context, micro-blogging has been widely adopted by users as an effective means to capture and disseminate their thoughts and actions to a larger audience on a daily basis. Interestingly, daily chatters of a user obtained from her micro-blogs offer a unique information source to analyze and interpret her context in real-time - i.e. interests, intentions,and activities. In this paper, we gather data from the public timeline of Twitter spanning across ten worldwide cities over a period of four weeks. We use this dataset to (a) explore how users express interests in real-time through micro-blogs, and (b) understand how text mining techniques can be applied to interpret real-time context of a user based on her tweets. Initial findings reported herein suggest that social media sites like Twitter constitute a promising source for extracting user context that can be exploited by novel social networking applications.


mobile data management | 2009

R-U-In? - Exploiting Rich Presence and Converged Communications for Next-Generation Activity-Oriented Social Networking

Nilanjan Banerjee; Dipanjan Chakraborty; Koustuv Dasgupta; Sumit Mittal; Seema Nagar; Saguna

With the growing popularity of social networking,traditional Internet Service Providers (ISPs) and Telecom operators have both started exploring new opportunities to boost their revenue streams. The efforts have facilitated consumers to stay connected to their favorite social networks,be it from an ISP portal or a mobile device. The use of Web 2.0technologies and converged communication tools has further led to a rise in both user-generated content as well as contextual information (i.e. rich presence) about users – including their current location, availability, interests and moods. In this evolving landscape, social networking players need to innovate for value-centric usage models that increase customer stickiness,along with business models to monetize the social media. To this end, we present R-U-In? - an activity-oriented social networking system for users to collaborate and participate in activities of mutual interest. Activities can be initiated and scheduled on-demand and be as ephemeral as the user interests themselves. R-U-In? leverages contextual modeling and reasoning techniques to enable “social search” based on real-time user interests and finds potential matches for the proposed activity. Further, it exploits next-generation presence and communication technologies to manage the entire activity lifecycle in real-time. Initial survey results, based on a prototype implementation of R-U-In?, attest to the promise of realtime activity-oriented social networking - both in terms of an effective collaboration tool for value-oriented social networking users and an enhanced end-user experience.


international world wide web conferences | 2012

Characterization of social media response to natural disasters

Seema Nagar; Aaditeshwar Seth; Anupam Joshi

Online social networking websites such as Twitter and Facebook often serve a breaking-news role for natural disasters: these websites are among the first ones to mention the news, and because they are visited by millions of users regularly the websites also help communicate the news to a large mass of people. In this paper, we examine how news about these disasters spreads on the social network. In addition to this, we also examine the countries of the Tweeting users. We examine Twitter logs from the 2010 Philippines typhoon, the 2011 Brazil flood and the 2011 Japan earthquake. We find that although news about the disaster may be initiated in multiple places in the social network, it quickly finds a core community that is interested in the disaster, and has little chance to escape the community via social network links alone. We also find evidence that the world at large expresses concern about such largescale disasters, and not just countries geographically proximate to the epicenter of the disaster. Our analysis has implications for the design of fund raising campaigns through social networking websites.


european conference on information retrieval | 2013

Discovery and analysis of evolving topical social discussions on unstructured microblogs

Kanika Narang; Seema Nagar; Sameep Mehta; L. V. Subramaniam; Kuntal Dey

Social networks have emerged as hubs of user generated content. Online social conversations can be used to retrieve users interests towards given topics and trends. Microblogging platforms like Twitter are primary examples of social networks with significant volumes of topical message exchanges between users. However, unlike traditional online discussion forums, blogs and social networking sites, explicit discussion threads are absent from microblogging networks like Twitter. This inherent absence of any conversation framework makes it challenging to distinguish conversations from mere topical interests. In this work, we explore semantic, social and temporal relationships of topical clusters formed in Twitter to identify conversations. We devise an algorithm comprising of a sequence of steps such as text clustering, topical similarity detection using TF-IDF and Wordnet, and intersecting social, semantic and temporal graphs to discover social conversations around topics. We further qualitatively show the presence of social localization of discussion threads. Our results suggest that discussion threads evolve significantly over social networks on Twitter. Our algorithm to find social discussion threads can be used for settings such as social information spreading applications and information diffusion analyses on microblog networks.


World Wide Web | 2014

Like-minded communities: bringing the familiarity and similarity together

Natwar Modani; Seema Nagar; Saswata Shannigrahi; Ritesh K. Gupta; Kuntal Dey; Saurabh Goyal; Amit Anil Nanavati

Community detection in social networks is a well-studied problem. A community in social network is commonly defined as a group of people whose interactions within the group are more than outside the group. It is believed that people’s behavior can be linked to the behavior of their social neighborhood. While shared characteristics of communities have been used to validate the communities found, to the best of authors’ knowledge, it is not demonstrated in the literature that communities found using social interaction data are like-minded, i.e., they behave similarly in terms of their interest in items (e.g., movie, products). In this paper, we experimentally demonstrate, on a social networking movie rating dataset, that people who are interested in an item are socially better connected than the overall graph. Motivated by this fact, we propose a method for finding communities wherein like-mindedness is an explicit objective. We find small tight groups with many shared interests using a frequent item set mining approach and use these as building blocks for the core of these like-minded communities. We show that these communities have higher similarity in their interests compared to communities found using only the interaction information. We also compare our method against a baseline where the weight of edges are defined based on similarity in interests between nodes and show that our approach achieves far higher level of like-mindedness amongst the communities compared to this baseline as well.


international conference on data engineering | 2015

DiSCern: A diversified citation recommendation system for scientific queries

Tanmoy Chakraborty; Natwar Modani; Ramasuri Narayanam; Seema Nagar

Performing literature survey for scholarly activities has become a challenging and time consuming task due to the rapid growth in the number of scientific articles. Thus, automatic recommendation of high quality citations for a given scientific query topic is immensely valuable. The state-of-the-art on the problem of citation recommendation suffers with the following three limitations. First, most of the existing approaches for citation recommendation require input in the form of either the full article or a seed set of citations, or both. Nevertheless, obtaining the recommendation for citations given a set of keywords is extremely useful for many scientific purposes. Second, the existing techniques for citation recommendation aim at suggesting prestigious and well-cited articles. However, we often need recommendation of diversified citations of the given query topic for many scientific purposes; for instance, it helps authors to write survey papers on a topic and it helps scholars to get a broad view of key problems on a topic. Third, one of the problems in the keyword based citation recommendation is that the search results typically would not include the semantically correlated articles if these articles do not use exactly the same keywords. To the best of our knowledge, there is no known citation recommendation system in the literature that addresses the above three limitations simultaneously. In this paper, we propose a novel citation recommendation system called DiSCern to precisely address the above research gap. DiSCern finds relevant and diversified citations in response to a search query, in terms of keyword(s) to describe the query topic, while using only the citation graph and the keywords associated with the articles, and no latent information. We use a novel keyword expansion step, inspired by community finding in social network analysis, in DiSCern to ensure that the semantically correlated articles are also included in the results. Our proposed approach primarily builds on the Vertex Reinforced Random Walk (VRRW) to balance prestige and diversity in the recommended citations. We demonstrate the efficacy of DiSCern empirically on two datasets: a large publication dataset of more than 1.7 million articles in computer science domain and a dataset of more than 29,000 articles in theoretical high-energy physics domain. The experimental results show that our proposed approach is quite efficient and it outperforms the state-of-the-art algorithms in terms of both relevance and diversity.


international conference on image processing | 2016

Eye center localization and detection using radial mapping

Karan Ahuja; Ruchika Banerjee; Seema Nagar; Kuntal Dey; Ferdous A. Barbhuiya

We propose a geometrical method, applied over eye-specific features, to improve the accuracy of the art of eye-center localization. Our solution is built upon: (a) checking radially constrained gradient vectors, (b) adding weightage to iris specific features and (c) considering bi-directional image gradients to eliminate errors due to reflection on pupil. Our system outperforms the state of the art methods, when compared collectively across multiple benchmark databases, such as BioID and FERET. Our process is lightweight, robust and significantly fast: achieving 50-60 fps for eye center localization, using a single threaded approach on a 2.4 GHz CPU with no GPU. This makes it practicable for real-life applications.


international conference on image processing | 2016

ISURE: User authentication in mobile devices using ocular biometrics in visible spectrum

Karan Ahuja; Abhishek Bose; Seema Nagar; Kuntal Dey; Ferdous A. Barbhuiya

In this paper, we propose a supervised learning based model for ocular biometrics. Using Speeded-Up Robust Features (SURF) for detecting local features of the eye region, we create a local feature descriptor vector of each image. We cluster these feature vectors, representing an image as a normalized histogram of membership to various clusters, thereby creating a bag-of-visual-words model. We conduct a multiphase training, first performing a fast Multinomial Naïve Bayes learning, and subsequently using a pyramid-up topology to use the top k% results (based upon confidence scores) thus predicted and perform Dense SIFT for nearest neighbor matching. Contrary to traditional ocular biometric systems, our proposed approach does not rely highly accurate iris pattern segmentation, allowing less constrained image acquisition conditions such as from mobile devices. Our method identifies the individuals with an identification accuracy varying from 48.76% to 79.49%, across different lighting conditions and phone handset data sources, while testing on the given data.


conference on computational natural language learning | 2016

Leveraging Cognitive Features for Sentiment Analysis.

Abhijit Mishra; Diptesh Kanojia; Seema Nagar; Kuntal Dey; Pushpak Bhattacharyya

Sentiments expressed in user-generated short text and sentences are nuanced by subtleties at lexical, syntactic, semantic and pragmatic levels. To address this, we propose to augment traditional features used for sentiment analysis and sarcasm detection, with cognitive features derived from the eye-movement patterns of readers. Statistical classification using our enhanced feature set improves the performance (F-score) of polarity detection by a maximum of 3.7% and 9.3% on two datasets, over the systems that use only traditional features. We perform feature significance analysis, and experiment on a held-out dataset, showing that cognitive features indeed empower sentiment analyzers to handle complex constructs.


mining software repositories | 2013

Bug resolution catalysts: Identifying essential non-committers from bug repositories

Senthil Mani; Seema Nagar; Debdoot Mukherjee; Ramasuri Narayanam; Vibha Singhal Sinha; Amit Anil Nanavati

Bugs are inevitable in software projects. Resolving bugs is the primary activity in software maintenance. Developers, who fix bugs through code changes, are naturally important participants in bug resolution. However, there are other participants in these projects who do not perform any code commits. They can be reporters reporting bugs; people having a deep technical know-how of the software and providing valuable insights on how to solve the bug; bug-tossers who re-assign the bugs to the right set of developers. Even though all of them act on the bugs by tossing and commenting, not all of them may be crucial for bug resolution. In this paper, we formally define essential non-committers and try to identify these bug resolution catalysts. We empirically study 98304 bug reports across 11 open source and 5 commercial software projects for validating the existence of such catalysts. We propose a network analysis based approach to construct a Minimal Essential Graph that identifies such people in a project. Finally, we suggest ways of leveraging this information for bug triaging and bug report summarization.

Collaboration


Dive into the Seema Nagar's collaboration.

Researchain Logo
Decentralizing Knowledge