58 Hits in 2.0 sec

Navigationaided retrieval

Shashank Pandit, Christopher Olston
2007 Proceedings of the 16th international conference on World Wide Web - WWW '07  
Users searching for information in hypermedia environments often perform querying followed by manual navigation. Yet, the conventional text/hypertext retrieval paradigm does not explicity take post-query navigation into account. This paper proposes a new retrieval paradigm, called navigationaided retrieval (NAR), which treats both querying and navigation as first-class activities. In the NAR paradigm, querying is seen as a means to identify starting points for navigation, and navigation is
more » ... d based on information supplied in the query. NAR is a generalization of the conventional probabilistic information retrieval paradigm, which implicitly assumes no navigation takes place. This paper presents a formal model for navigation-aided retrieval, and reports empirical results that point to the real-world applicability of the model. The experiments were performed over a large Web corpus provided by TREC, using human judgments on a new rating scale developed for navigation-aided retrieval. In the case of ambiguous queries, the new retrieval model identifies good starting points for post-query navigation. For less ambiguous queries that need not be paired with navigation, the output closely matches that of a conventional retrieval system. ACM 978-1-59593-654-7/07/0005. hyperlinks) [30] . There are at least three reasons for using navigation as a search tactic: Navigation-Aided Retrieval We propose a new hypertext retrieval paradigm that incorporates post-query user navigation as an explicit component, called navigation-aided retrieval (NAR). With NAR, as with the conventional paradigm, users submit freely-chosen keyword queries and are presented with a ranked list of documents. Unlike with the conventional paradigm, the documents in the list represent starting points from which the user can commence exploration. Loosely speaking, good
doi:10.1145/1242572.1242626 dblp:conf/www/PanditO07 fatcat:llouu3kjczdc5gcbgypll5knie


Shashank Pandit, Duen Horng Chau, Samuel Wang, Christos Faloutsos
2007 Proceedings of the 16th international conference on World Wide Web - WWW '07  
Given a large online network of online auction users and their histories of transactions, how can we spot anomalies and auction fraud? This paper describes the design and implementation of NetProbe, a system that we propose for solving this problem. NetProbe models auction users and transactions as a Markov Random Field tuned to detect the suspicious patterns that fraudsters create, and employs a Belief Propagation mechanism to detect likely fraudsters. Our experiments show that NetProbe is
more » ... efficient and effective for fraud detection. We report experiments on synthetic graphs with as many as 7,000 nodes and 30,000 edges, where NetProbe was able to spot fraudulent nodes with over 90% precision and recall, within a matter of seconds. We also report experiments on a real dataset crawled from eBay, with nearly 700,000 transactions between more than 66,000 users, where NetProbe was highly effective at unearthing hidden networks of fraudsters, within a realistic response time of about 6 minutes. For scenarios where the underlying data is dynamic in nature, we propose Incremental NetProbe, which is an approximate, but fast, variant of Net-Probe. Our experiments prove that Incremental NetProbe executes nearly doubly fast as compared to NetProbe, while retaining over 99% of its accuracy.
doi:10.1145/1242572.1242600 dblp:conf/www/PanditCWF07 fatcat:o2dxptvcd5dkfauehzpsi5lrde


Sihem Amer-Yahia, Laks V. S. Lakshmanan, Shashank Pandit
2004 Proceedings of the 2004 ACM SIGMOD international conference on Management of data - SIGMOD '04  
Querying XML data is a well-explored topic with powerful databasestyle query languages such as XPath and XQuery set to become W3C standards. An equally compelling paradigm for querying XML documents is full-text search on textual content. In this paper, we study fundamental challenges that arise when we try to integrate these two querying paradigms. While keyword search is based on approximate matching, XPath has exact match semantics. We address this mismatch by considering queries on
more » ... as a "template", and looking for answers that best match this template and the full-text search. To achieve this, we provide an elegant definition of relaxation on structure and define primitive operators to span the space of relaxations. Query answering is now based on ranking potential answers on structural and full-text search conditions. We set out certain desirable principles for ranking schemes and propose natural ranking schemes that adhere to these principles. We develop efficient algorithms for answering top-K queries and discuss results from a comprehensive set of experiments that demonstrate the utility and scalability of the proposed framework and algorithms.
doi:10.1145/1007568.1007581 dblp:conf/sigmod/Amer-YahiaLP04 fatcat:kivqnzy7ibbn5enokrgilyp3ua

Detecting Fraudulent Personalities in Networks of Online Auctioneers [chapter]

Duen Horng Chau, Shashank Pandit, Christos Faloutsos
2006 Lecture Notes in Computer Science  
Online auctions have gained immense popularity by creating an accessible environment for exchanging goods at reasonable prices. Not surprisingly, malevolent auction users try to abuse them by cheating others. In this paper we propose a novel method, 2-Level Fraud Spotting (2LFS), to model the techniques that fraudsters typically use to carry out fraudulent activities, and to detect fraudsters preemptively. Our key contributions are: (a) we mine user level features (e.g., number of transactions,
more » ... average price of goods exchanged, etc.) to get an initial belief for spotting fraudsters, (b) we introduce network level features which capture the interactions between different users, and (c) we show how to combine both these features using a Belief Propagation algorithm over a Markov Random Field, and use it to detect suspicious patterns (e.g., unnaturally close-nit groups of people that trade mainly among themselves). Our algorithm scales linearly with the number of graph edges. Moreover, we illustrate the effectiveness of our algorithm on a real dataset collected from a large online auction site.
doi:10.1007/11871637_14 fatcat:z72w7hfu5rfcbe5reopvewvufa

Parallel crawling for online social networks

Duen Horng Chau, Shashank Pandit, Samuel Wang, Christos Faloutsos
2007 Proceedings of the 16th international conference on World Wide Web - WWW '07  
Given a huge online social network, how do we retrieve information from it through crawling? Even better, how do we improve the crawling performance by using parallel crawlers that work independently? In this paper, we present the framework of parallel crawlers for online social networks, utilizing a centralized queue. To show how this works in practice, we describe our implementation of the crawlers for an online auction website. The crawlers work independently, therefore the failing of one
more » ... wler does not affect the others at all. The framework ensures that no redundant crawling would occur. Using the crawlers that we built, we visited a total of approximately 11 million auction users, about 66,000 of which were completely crawled.
doi:10.1145/1242572.1242809 dblp:conf/www/ChauPWF07 fatcat:goj2nsxqsjg5rdxbx7ivecgto4

Bidirectional Expansion For Keyword Search on Graph Databases

Varun Kacholia, Shashank Pandit, Soumen Chakrabarti, S. Sudarshan, Rushi Desai, Hrishikesh Karambelkar
2005 Very Large Data Bases Conference  
Relational, XML and HTML data can be represented as graphs with entities as nodes and relationships as edges. Text is associated with nodes and possibly edges. Keyword search on such graphs has received much attention lately. A central problem in this scenario is to efficiently extract from the data graph a small number of the "best" answer trees. A Backward Expanding search, starting at nodes matching keywords and working up toward confluent roots, is commonly used for predominantly
more » ... queries. But it can perform poorly if some keywords match many nodes, or some node has very large degree. In this paper we propose a new search algorithm, Bidirectional Search, which improves on Backward Expanding search by allowing forward search from potential roots towards leaves. To exploit this flexibility, we devise a novel search frontier prioritization technique based on spreading activation. We present a performance study on real data, establishing that Bidirectional Search significantly outperforms Backward Expanding search.
dblp:conf/vldb/KacholiaPCSDK05 fatcat:dkavrqo4ubc6tf2fxh5tw7hwd4

Class of Tests Based on Subsample Quantiles for Two-sample Scale Problem

Shashank D. Shindhe, Sharada V. Bhat, Parameshwar V. Pandit
2021 Asian Journal of Probability and Statistics  
A class of distribution-free tests based on U-statistics with its kernel being function of subsample quantiles is proposed for a two-sample scale problem. The proposed class of tests is a general class of tests that includes numerous members which explore information from the tails of the distributions and tests resistant to outliers. This class of tests includes many existing classes of tests as its subclasses. The distribution of the proposed class of tests is derived and its relevance is
more » ... ussed. One of its members, which is resistant to outliers in -sample is investigated in detail.
doi:10.9734/ajpas/2021/v12i130276 fatcat:inhz66gga5cbtjq3x2emy4oyha

Clinical grade CAR T cell manufacturing & process development – The role of Leukapheresis

Albeena Nisar, Minal Poojary, Deepali Pandit, Chetan Dhamne, Husmukh Jain, Shashank Ojha, Navin Khattry, Shripad Banavali, Gaurav Narula
2020 Pediatric Hematology Oncology Journal  
doi:10.1016/j.phoj.2021.04.148 fatcat:l5gqnetzijadverqaealtqrwc4

Surgical management of pelvic bone sarcoma with internal hemipelvectomy: Oncologic and Functional outcomes

Abhijeet Ashok Salunke, Jaymin Shah, Vikas Warikoo, Amit Chakraborty, Harshwardhan Sahijwani, Mohit Sharma, Rohit Jha, Avdhoot Dhange, Subodh Pathak, Jyotindra Pandit, Manish Pruthi, Shashank Pandya (+1 others)
2017 Journal of Clinical Orthopaedics and Trauma  
A B S T R A C T Introduction: The management of pelvic sarcoma is challenging and goals of surgery are adequate oncologic local control, maintenance of optimum function with good quality of life. Methods: We have evaluated the results of internal hemipelvecotmy including age, type of resection, reconstruction, radiotherapy or chemotherapy. From 2010 to 2016, 23 patients with pelvic bone tumors (13 with Ewing's sarcoma, 9 with Osteosarcoma, 1 with chondrosarcoma) were treated by surgical
more » ... n. Results: The mean follow-up was 18 months (0.5-5) years. In 12 patients reconstruction was performed and 11 were without reconstruction. A total of 3 patients (13%) had an infection develop at a mean follow up of 1 month. Surgical debridement's and antibiotics in three patients led to complete recovery. One patient had sciatic nerve injury.One patient had injury to femoral vein; was treated with femoral vein reconstruction. Two patients (9%) developed a local recurrence and were treated with best supportive treatment. Distal pulmonary metastases were seen in four patients and treated with supportive treatment. Five-year disease-specific survival rates of all patients were 83%. The mean functional MSTS score was 18(14-24). Conclusions: Proper selection of patients, preopertive planning and wide surgical margins with reconstruction provides good functional outcomes following internal hemipelvectomy. The surgical site infection and flap necrosis tend to be minor complication and can be managed leading to optimal outcomes and justifies the need for this complex surgery. The oncological and functional outcome after internal hemipelvectomy suggests that it's an effective method for treatment of patients with pelvic sarcomas.
doi:10.1016/j.jcot.2017.04.004 pmid:28951642 pmcid:PMC5605741 fatcat:k46y3vpwkffm3emk4iqsfpr2om


2020 2020 12th International Conference on Computational Intelligence and Communication Networks (CICN)  
Shubham Mahajan; Shagun Gupta; Amit Kant Pandit Implementation and Analysis of Various Visual Cryptographic Techniques for Sensitive Data Protection …………………………………………………………………………………….  ...  Sumit Kumar Pandey, Prity Gupta & Shashank Shekhar Dwivedi Hand Sign Translation to Audio Message and Text Message: A Device …………………… Aastha Nagpal; Ketaki Singha ; Rakshita gouri, Aqusa Noor, Ashish Bagwari  ... 
doi:10.1109/cicn49253.2020.9242567 fatcat:ffhw5e4ncrbu7orpgsob42qrma

ICBC 2020 Table of Contents

2020 2020 IEEE International Conference on Blockchain and Cryptocurrency (ICBC)  
Mamageishvili, Jan Christoph Schlegel TS03-2 Smart Contract Protocol for Authenticity and Compliance with Anonymity on Hyperledger Fabric Rishi Saket, Nitin Singh, Pankaj Dayama, Vinayaka Pandit  ...  Tolerance Tradeoffs in Sharded Permissioned Blockchains Chunyu Mao, Anh Duong Nguyen, Wojciech Golab PD3B-2 FabricUnit: A Framework for Faster Execution of Unit Tests on Hyperledger Fabric Shashank  ... 
doi:10.1109/icbc48266.2020.9169403 fatcat:3qr6dx2wlzanlhjkfjavjbm5yq


Achintya Narayan Ray, Narayan Pandit
2019 Journal of Evidence Based Medicine and Healthcare  
had mixed dyslipidaemia; among them high TC + high TG + raised LDL-C(8.33%); high TG +low HDL-C + raised LDL-C (2.77%); high TC+ high TG+ low HDL-C + raised LDL-(4.16%); of cases; ICMR INDIAB study by Shashank  ...  Mean Lipid Profile Value in Diabetic Patient Type Total Isolated 60(41.66%) Combined 46(31.94%) mixed 24(16.66%) Table 5 . 5 Breakdown of The Pattern of Dyslipidaemia ICMR INDIAB study by Shashank  ... 
doi:10.18410/jebmh/2019/402 fatcat:33vueul4fnfnxacgj74d2naa5m


2021 2021 International Conference on Computing, Communication and Green Engineering (CCGE)  
Akshay Pandit Landage, Mr. Swapnil LIDA BAMIZADEH, Dr. Binod 234 Document Repositories Kumar, Dr.  ...  Shashank. D. Joshi, Dr. Rohini Jadhav 5 118 Street Security and Surveillance for Rapid Emergency Assistance and Effective Traffic Management Mr. Shubham D.  ... 
doi:10.1109/ccge50943.2021.9776478 fatcat:23esqzpsqzezdgzazjz6n6weqe

Table of Contents

2021 2021 Devices for Integrated Circuit (DevIC)  
A 0.6 V 1.6 nA Constant Current Reference Circuit with Improved Power Supply Sensitivity Taha Saquib, Saheli Sarkhel and Soumya Pandit 109.  ...  Robust Design of Noise Tolerant 2-Phase Non Overlapping Clock Generating Circuit Saianudeep Reddy Nayini, Krishna Sai Kushal Gella, Shashank Kumar Dubey, Manisha Guduri and Aminul Islam 211-215  ... 
doi:10.1109/devic50843.2021.9455830 fatcat:rcbgrlyelff63bwlbohfsytsyi

PuneCon 2019 Presentation Schedule

2019 2019 IEEE Pune Section International Conference (PuneCon)  
Machine learning and Blockchain Techniques used in Healthcare System 90 Ela Gore and Sheetal Rathi Surveying Machine Learning algorithms on EEG signals data for Mental Health Assessment 108 Parth Sagar, Shashank  ...  Gaits Day -2 (20 th December 2019) Friday 10:00 am to 12:45 pm Session -2 Track -Phadke Venue : IT Conference Room (A-404) Paper ID Author name Title of Paper 19 Rajender Kumar and Amit Kant Pandit  ... 
doi:10.1109/punecon46936.2019.9105901 fatcat:uh57ftk6a5civlrw2jeynyyjvu
« Previous Showing results 1 — 15 out of 58 results