3,491 Hits in 3.4 sec

Active Machine Learning for Consideration Heuristics

Daria Dzyabura, John R. Hauser
2011 Marketing science (Providence, R.I.)  
The basic algorithm focuses on conjunctive or disjunctive rules, but we demonstrate generalizations to more complex heuristics and to the use of previous-respondent data to improve consumer-specific priors  ...  Eric Bradlow and then Preyas Desai served as the editor-in-chief and Fred Feinberg served as associate editor for this article.  ...  Acknowledgments This research was supported by the MIT Sloan School of Management, the Center for Digital Business at MIT (, and an unnamed American automotive manufacturer.  ... 
doi:10.1287/mksc.1110.0660 fatcat:iy3g2p57qjaifbsgzfax2sl3zq

MAGIC Tool: integrated microarray data analysis

L. J Heyer, D. Z. Moskowitz, J. A. Abele, P. Karnik, D. Choi, A. M. Campbell, E. E. Oldham, B. K. Akin
2005 Bioinformatics  
Several unique features of MAGIC Tool are particularly useful for research and teaching.  ...  Several programs are now available for analyzing the large datasets arising from cDNA microarray experiments.  ...  ACKNOWLEDGEMENTS We thank many users and workshop attendees for useful suggestions about MAGIC Tool, and gratefully acknowledge support from NSF DBI-0099720 and Davidson College.  ... 
doi:10.1093/bioinformatics/bti247 pmid:15647303 fatcat:jq4dpi2apjawlepxwyfrf3z4na

Efficient generation of inductive validity cores for safety properties

Elaheh Ghassabani, Andrew Gacek, Michael W. Whalen
2016 Proceedings of the 2016 24th ACM SIGSOFT International Symposium on Foundations of Software Engineering - FSE 2016  
We then present an experiment in which we benchmark the algorithm in terms of speed, diversity of produced cores, and minimality, with promising results.  ...  We prove our algorithm is correct, and describe its implementation in the JKind model checker for Lustre models.  ...  The experiments were run on an Intel(R) i5-2430M, 2.40GHz, 4GB memory machine, with a 1 hour timeout for each analysis on any model.  ... 
doi:10.1145/2950290.2950346 dblp:conf/sigsoft/GhassabaniGW16 fatcat:7demgpt6gzfbxi3sjzcy64c7qu

Opportunistic physical design for big data analytics

Jeff LeFevre, Jagan Sankaranarayanan, Hakan Hacigumus, Junichi Tatemura, Neoklis Polyzotis, Michael J. Carey
2014 Proceedings of the 2014 ACM SIGMOD international conference on Management of data - SIGMOD '14  
We present a semantic model for UDFs that enables effective reuse of views containing UDFs along with a rewrite algorithm that provably finds the minimum-cost rewrite under certain assumptions.  ...  When jobs correspond to exploratory queries submitted by data analysts, these materializations yield a large set of materialized views that we propose to treat as an opportunistic physical design.  ...  Acknowledgement: We thank Jeffrey Naughton for his insightful comments on the earlier versions of the paper. We also thank the anonymous SIGMOD reviewers for their useful feedback. J. LeFevre and N.  ... 
doi:10.1145/2588555.2610512 dblp:conf/sigmod/LeFevreSHTPC14 fatcat:cxxd4kzvgzbefiks64dnwnagk4

Approximate Evaluation of Label-Constrained Reachability Queries [article]

Stefania Dumbrava, Angela Bonifati, Amaia Nazabal Ruiz Diaz, and Romain Vuillemot
2018 arXiv   pre-print
Nonetheless, our GRASP summaries are reasonably small in practice, even for large graph instances, and guarantee approximate graph query answering, paired with controllable error estimates.  ...  Despite the maturity of graph DBMS capabilities, complex label-constrained reachability queries, along with their corresponding aggregate versions, remain difficult to evaluate.  ...  Our analysis also proves the effectiveness and efficiency of the GRASP algorithm on datasets with varying degrees of heterogeneity and sizes.  ... 
arXiv:1811.11561v1 fatcat:t355eg4akjgnhdv5d5jmgpy45a

Determining Attributes to Maximize Visibility of Objects

M. Miah, G. Das, V. Hristidis, H. Mannila
2009 IEEE Transactions on Knowledge and Data Engineering  
searching for products in a catalog).  ...  In recent years, there has been significant interest in the development of ranking functions and efficient top-k retrieval algorithms to help users in ad-hoc search and retrieval in databases (e.g., buyers  ...  Top-k Retrieval via Global Scoring Function: Let Score(t) be a function that returns a real-valued score for any tuple t. Let k be a small integer associated with a query q.  ... 
doi:10.1109/tkde.2009.72 fatcat:eavx2lkgmvg27mlqn65qema65u

Exploratory Professional Search through Semantic Post-Analysis of Search Results [chapter]

Pavlos Fafalios, Yannis Tzitzikas
2014 Lecture Notes in Computer Science  
that is based on semantic post-analysis of the classical search results (of keyword based queries).  ...  For helping the user to get efficiently a concise overview, to quickly restrict the search space and to make sense of the results, in this article we present an exploratory strategy for professional search  ...  Thus, the approach that we propose can use any NEE system, independently of the underlying NLP algorithm.  ... 
doi:10.1007/978-3-319-12511-4_9 fatcat:xaprsqtxabhlddurfhmi5fspga

A constraint-based querying system for exploratory pattern discovery

Francesco Bonchi, Fosca Giannotti, Claudio Lucchese, Salvatore Orlando, Raffaele Perego, Roberto Trasarti
2009 Information Systems  
Through the interaction with a friendly GUI, the user can define complex mining queries by means of few clicks.  ...  In this article we present ConQueSt, a constraint based querying system able to support the intrinsically exploratory (i.e., human-guided, interactive, iterative) nature of pattern discovery.  ...  Handling monotone constraints in conjunction with the minimum frequency constraint (that it is always present in any query) and with other anti-monotone constraints, turns out to be very difficult due  ... 
doi:10.1016/ fatcat:injmad4ckvevrpxf4rpb66ul6a

Exploring path query results through relevance feedback

Huiping Cao, Yan Qi, K. Selçuk Candan, Maria Luisa Sapino
2009 Proceeding of the 18th ACM conference on Information and knowledge management - CIKM '09  
Given a path query and a set of results identified by the system to this query over the data, we consider feedback which captures the user's preference for some features over the others.  ...  To deal with feedback, we develop a probabilistic feature significance measure and describe how to use this for ranking results in the presence of dependencies between the path features.  ...  AXP splits any complex feedback statement into its constituent 1and 2-label feature elements for further analysis.  ... 
doi:10.1145/1645953.1646275 dblp:conf/cikm/CaoQCS09 fatcat:6g3sxwmrejc2jibriooj5spfhq

Feedback-driven result ranking and query refinement for exploring semi-structured data collections

Huiping Cao, Yan Qi, K. Selçuk Candan, Maria Luisa Sapino
2010 Proceedings of the 13th International Conference on Extending Database Technology - EDBT '10  
To deal with the hard feedback efficiently (i.e., fast enough for interactive exploration), we present finite automata based query refinement solutions.  ...  We bring together these techniques in AXP, a system for adaptive and exploratory path retrieval. The experimental results show the effectiveness of the proposed techniques.  ...  Structural Feature Elements AXP splits any complex feedback statement into its constituent 1-and 2-label feature elements for further analysis.  ... 
doi:10.1145/1739041.1739046 dblp:conf/edbt/CaoQCS10 fatcat:olq6lzrfz5cetmcokkh6plhxhu

The security of machine learning

Marco Barreno, Blaine Nelson, Anthony D. Joseph, J. D. Tygar
2010 Machine Learning  
Machine learning has become a fundamental tool for computer security since it can rapidly evolve to changing and complex situations.  ...  We show how these classes influence the costs for the attacker and defender, and we give a formal structure defining their interaction.  ...  The opinions expressed in this paper are solely those of the authors and do not necessarily reflect the opinions of any funding agency, the State of California, or the U.S. government.  ... 
doi:10.1007/s10994-010-5188-5 fatcat:3ytty65oknh7lkl6tfovfmu5ra

Eagle-eyed elephant

Mohamed Y. Eltabakh, Fatma Özcan, Yannis Sismanis, Peter J. Haas, Hamid Pirahesh, Jan Vondrak
2013 Proceedings of the 16th International Conference on Extending Database Technology - EDBT '13  
An increasingly important analytics scenario for Hadoop involves multiple (often ad hoc) grouping and aggregation queries with selection predicates over a slowly changing dataset.  ...  These queries are typically expressed via high-level query languages such as Jaql, Pig, and Hive, and are used either directly for business-intelligence applications or to prepare the data for statistical  ...  The analytics needed for marketing and risk assessment are highly varied, involving custom algorithms and many different third-party modules that require exploratory analysis and various statistical summaries  ... 
doi:10.1145/2452376.2452388 dblp:conf/edbt/EltabakhOSHPV13 fatcat:p66x6fqycvgvblgreweuk5kyti

Evaluating Relevance Feedback Algorithms for Searching on Small Displays [chapter]

Vishwa Vinay, Ingemar J. Cox, Natasa Milic-Frayling, Ken Wood
2005 Lecture Notes in Computer Science  
Our results bring out the strengths and weaknesses of the algorithms, and the need for exploratory display strategies with conservative feedback algorithms.  ...  Three standard feedback algorithms are considered -Rocchio, Robertson/Sparck-Jones and a Bayesian algorithm.  ...  For comparison purposes, this number is compared with the rank of the document after the initial query, i.e. before any relevance feedback is applied.  ... 
doi:10.1007/978-3-540-31865-1_14 fatcat:zkpuvvg64bf7fbg6igcrdy6dm4

Extending the state-of-the-art of constraint-based pattern discovery

Francesco Bonchi, Claudio Lucchese
2007 Data & Knowledge Engineering  
A thorough experimental study is performed and it confirms that our framework outperforms previous algorithms for convertible constraints, and exploit the tougher ones with the same effectiveness.  ...  The constraint-based pattern discovery paradigm was introduced with the aim of providing to the user a tool to drive the discovery process towards potentially interesting patterns, with the positive side  ...  Our framework is unifying not only because it fits every constraints, but also because it can cope with any conjunction of constraints, thus giving even more expressive power to users queries. (1) In Section  ... 
doi:10.1016/j.datak.2006.02.006 fatcat:7p3zuyvgcbdofjy7bvpcarxsba

Minimum-effort driven dynamic faceted search in structured databases

Senjuti Basu Roy, Haidong Wang, Gautam Das, Ullas Nambiar, Mukesh Mohania
2008 Proceeding of the 17th ACM conference on Information and knowledge mining - CIKM '08  
Our facet selection algorithms also work in conjunction with any ranked retrieval model where a ranking function imposes a bias over the user preferences for the selected tuples.  ...  In this paper, we propose minimum-effort driven navigational techniques for enterprise database systems based on the faceted search paradigm.  ...  We also extend our methods to work in conjunction with ranking functions for tuples.  ... 
doi:10.1145/1458082.1458088 dblp:conf/cikm/RoyWDNM08 fatcat:h7yutc2vnnfy7go6ydyekcrnca
« Previous Showing results 1 — 15 out of 3,491 results