Data-based research at IIT Bombay
References
[1]
A. Agarwal and S. Chakrabarti. Learning random walks to rank nodes in graphs. In ICML, 2007.
[2]
A. Agarwal, S. Chakrabarti, and S. Aggarwal. Learning to rank networked entities. In SIGKDD Conf., pages 14--23, 2006.
[3]
M. K. Agarwal, K. Ramamritham, and M. Bhide. Real time discovery of dense clusters in highly dynamic graphs: Identifying real world events in highly dynamic environments. In VLDB'12: Proc. of 38th Intl. Conf. on Very Large Data Bases, 2012.
[4]
A. Agrawal, S. Sudarshan, A. Sahoo, A. Sandalwala, and P. Jaiswal. Entity ranking and relationship queries using an extended graph model. In Intl. Conf. on Management of Data (COMAD), 2012.
[5]
S. Banerjee, S. Chakrabarti, and G. Ramakrishnan. Learning to rank for quantity consensus queries. In SIGIR Conf., 2009.
[6]
G. Bhalotia, A. Hulgeri, C. Nakhe, S. Chakrabarti, and S. Sudarshan. Keyword searching and browsing in databases using BANKS. In ICDE, 2002.
[7]
M. Bhide, P. Deolasee, A. Katkar, A. Panchbudhe, K. Ramamritham, and P. Shenoy. Adaptive push pull: Disseminating dynamic web data. IEEE Transactions on Computers, 51:652--668, 2002.
[8]
M. Bhide, K.Ramamritham, and P.Roy. Keyword search over dynamic categorized information. In Intl. Conf. on Data Engineering, 2009.
[9]
M. Bhide and K. Ramamritham. Category based infidelity bounded queries over unstructured data streams. In IEEE Transactions on Knowledge and Data Engineering, 2013.
[10]
M. Bhide, K. Ramamritham, and M. Agrawal. Efficient execution of continuous incoherency bounded queries over multi-source streaming data. In Intl. Conf. on Distributed Computing Systems, 2007.
[11]
S. Chakrabarti. Mining the Web: Discovering Knowledge from Hypertext Data. Morgan-Kauffman, 2002.
[12]
S. Chakrabarti, S. Kasturi, B. Balakrishnan, G. Ramakrishnan, and R. Saraf. Compressed data structures for annotated web search. In WWW Conf., pages 121--130, 2012.
[13]
S. Chakrabarti, A. Pathak, and M. Gupta. Index design and query processing for graph conductance search. VLDB Journal, 2010.
[14]
S. Chakrabarti, D. Sane, and G. Ramakrishnan. Web-scale entity-relation search architecture (poster). In WWW Conf., pages 21--22, 2011.
[15]
A. Chalamalla, S. Negi, L. V. Subramaniam, and G. Ramakrishnan. Identification of class specific discourse patterns. In CIKM, pages 1193--1202, 2008.
[16]
B. Chandra, B. Chawda, S. Shah, and S. Sudarshan. Extending XData to kill SQL query mutants in the wild. Unpublished manuscript, 2012.
[17]
M. Chavan, R. Guravannavar, K. Ramachandra, and S. Sudarshan. DBridge: A program rewrite tool for set-oriented query execution (demo). In ICDE, pages 1284--1287, 2011.
[18]
M. Chavan, R. Guravannavar, K. Ramachandra, and S. Sudarshan. Program transformations for asynchronous query submission. In ICDE, pages 375--386, 2011.
[19]
R. Gupta, A. Puri, and K. Ramamritham. Executing incoherency bounded continuous queries at web data aggregators. In WWW '05: Proc. of the 16th Intl. Conf. on World Wide Web, Chiba, Japan, 2005.
[20]
R. Gupta and K. Ramamritham. Optimized query planning of continuous aggregation queries in dynamic data dissemination networks. In WWW '07: Proc. of the 16th Intl. Conf. on World Wide Web, pages 321--330, Banff, Alberta, Canada, 2007.
[21]
R. Gupta and K. Ramamritham. Optimized query planning of continuous aggregation queries over a network of data aggregators. In IEEE Transactions on Knowledge and Data Engineering, 2010.
[22]
R. Gupta, K. Ramamritham, and M. Mohania. Executing ratio threshold queries over distributed data sources. In ICDE '10: Proc. of 26th IEEE Intl. Conf. on Data Engineering, 2010.
[23]
R. Gupta, K. Ramamritham. Scalable Execution of Continuous Aggregation Queries over Web Data. In IEEE Internet Computing 16(1): 43-51 2012.
[24]
R. Gupta and S. Sarawagi. Answering table augmentation queries from unstructured lists on the web. In PVLDB, 2009.
[25]
R. Gupta and S. Sarawagi. Joint training for open-domain extraction on the web: Exploiting overlap when supervision is limited. In WSDM, 2011.
[26]
R. Guravannavar and S. Sudarshan. Rewriting procedures for batched bindings. PVLDB, 1(1):1107--1123, 2008.
[27]
P. Jawanpuria, J. S. Nath, and G. Ramakrishnan. Efficient rule ensemble learning using hierarchical kernels. In ICML, pages 161--168, 2011.
[28]
S. Joshi, G. Ramakrishnan, and A. Srinivasan. Feature construction using theory-guided sampling and randomised search. In ILP, pages 140--157, 2008.
[29]
V. Kacholia, S. Pandit, S. Chakrabarti, S. Sudarshan, R. Desai, and H. Karambelkar. Bidirectional expansion for keyword search on graph databases. In VLDB, 2005.
[30]
N. Katariya, A. Iyer, and S. Sarawagi. Active evaluation of classifiers on large datasets. In ICDM (Runner-up for Best paper award), 2012.
[31]
S. Kulkarni, A. Singh, G. Ramakrishnan, and S. Chakrabarti. Collective annotation of Wikipedia entities in Web text. In SIGKDD Conf., pages 457--466, 2009.
[32]
G. Limaye, S. Sarawagi, and S. Chakrabarti. Annotating and searching web tables using entities, types and relationships. In VLDB, 2010.
[33]
A. Nagesh, G. Ramakrishnan, L. Chiticariu, R. Krishnamurthy, A. Dharkar, and P. Bhattacharyya. Towards efficient named-entity rule induction for customizability. In EMNLP-CoNLL, pages 128--138, 2012.
[34]
N. Nair, A. Govindan, C. Jayaraman, K. TVS, and G. Ramakrishnan. Pruning search space for weighted first order horn clause satisfiability. In ILP, 2010.
[35]
N. Nair, A. Nagesh, and G. Ramakrishnan. Probing the space of optimal markov logic networks for sequence labeling. In ILP, 2012.
[36]
N. Nair, A. Saha, G. Ramakrishnan, and S. Krishnaswamy. Rule ensemble learning using hierarchical kernels in structured output spaces. In AAAI, 2012.
[37]
R. Pimplikar and S. Sarawagi. Answering table queries on the web using column keywords. In Proc. of the 36th Int'l Conf. on Very Large Databases (VLDB), 2012.
[38]
K. Ramachandra and S. Sudarshan. Holistic optimization by prefetching query results. In SIGMOD, pages 133--144, 2012.
[39]
G. Ramakrishnan, S. Joshi, S. Balakrishnan, and A. Srinivasan. Using ilp to construct features for information extraction from semi-structured text. In ILP, pages 211--224, 2007.
[40]
A. Ramesh, S. Sudarshan, P. Joshi, and M. N. Gaonkar. Keyword search on form results. VLDB J., 22(1):99--123, 2013.
[41]
A. Saha, A. Srinivasan, and G. Ramakrishnan. What kinds of relational features are useful for statistical learning? In ILP, 2012.
[42]
S. Sarawagi and W. W. Cohen. Semi-markov conditional random fields for information extraction. In NIPS, 2004.
[43]
S. Sarawagi, V. S. Deshpande, and S. Kasliwal. Efficient top-k count queries over imprecise duplicates. In EDBT, 2009.
[44]
U. Sawant and S. Chakrabarti. Learning joint query interpretation and response ranking. In WWW Conf., Brazil, 2013.
[45]
S. Shah, K. Ramamritham, and P. J. Shenoy. Maintaining coherency of dynamic data in cooperating repositories. In VLDB, pages 526--537. Morgan Kaufmann, 2002.
[46]
S. Shah, S. Sudarshan, S. Kajbaje, S. Patidar, B. P. Gupta, and D. Vira. Generating test data for killing SQL mutants: A constraint-based approach. In ICDE, pages 1175--1186, 2011.
[47]
A. Silberschatz, H. F. Korth, and S. Sudarshan. Database System Concepts. McGraw-Hill, 6th edition, 2010.
[48]
L. Specia, A. Srinivasan, S. Joshi, G. Ramakrishnan, and M. das Graças Volpe Nunes. An investigation into feature construction to assist word sense disambiguation. Machine Learning, 76(1):109--136, 2009.
[49]
L. Specia, A. Srinivasan, G. Ramakrishnan, and M. das Graças Volpe Nunes. Word sense disambiguation using inductive logic programming. In ILP, pages 409--423, 2006.
[50]
A. Srinivasan and G. Ramakrishnan. Parameter screening and optimisation for ilp using designed experiments. Journal of Machine Learning Research, 12:627--662, 2011.
Index Terms
- Data-based research at IIT Bombay
Recommendations
Developmental informatics at IIT Bombay
IIT Bombay's Developmental Informatics Lab is a cross disciplinary group consisting of 6 faculty, 30 research staff and several students. The lab is working towards increasing access to information -- through the use of internet and communication ...
A rights-based approach to open government data
ICTD '19: Proceedings of the Tenth International Conference on Information and Communication Technologies and DevelopmentOpen Government Data(OGD) is the latest entrant to the field of Governance and to its sub-field of transparency and accountability. The data on many rights-based programmes are increasingly being published in the public domain to enable citizens to ...
Municipal open government an exploratory research: factor analysis for Mexican municipalities
dg.o '18: Proceedings of the 19th Annual International Conference on Digital Government Research: Governance in the Data AgeOpen Government (OG) has become a research trend among scholars and officials in the world. However, most of the research is focused on national or countries policies and implementations, related to OG, very few attention has been made to the basic ...
Comments
Information & Contributors
Information
Published In
Copyright © 2013 Authors.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 May 2013
Published in SIGMOD Volume 42, Issue 1
Check for updates
Qualifiers
- Column
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 237Total Downloads
- Downloads (Last 12 months)8
- Downloads (Last 6 weeks)0
Reflects downloads up to 09 Sep 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in