SearcharxivSearch

arXiv subjects

Beata Zielosko

Publications and source records attributed to Beata Zielosko.

3 recordsLinked to original sources

The Landscape of Generative AI in Information Systems: A Synthesis of Secondary Reviews and Research Agendas

The post-ChatGPT surge has rapidly reframed IS research and practice. As organizations and society grapple with GenAI adoption, a body of secondary studies and research agendas has emerged to synthesize early evidence and chart directions for future inquiry. This study reviews secondary and roadmap papers to synthesize the state of knowledge on GenAI's benefits and challenges in IS, and to identify future research directions. We performed a systematic search across Scopus, WoS, and eAIS for publications from 2023 onwards. Following a rigorous, multi-stage screening process, we selected a final set of 28 papers for analysis using bibliometric mapping and thematic analysis. We also conducted a quality assessment of all sources to gauge confidence in each source's contribution to the findings. GenAI offers transformative potential to drive productivity, accelerate innovation, personalize services, and democratize access to expertise. However, its adoption is constrained by interrelated challenges: technical unreliability, societal-ethical risks, and a governance vacuum. Interpreted through a socio-technical lens, our findings reveal a persistent misalignment between GenAI's fast-evolving technical subsystem and the slower-adapting social subsystem, positioning IS research as critical for achieving joint optimization. To bridge this gap, we propose a research agenda that reorients IS scholarship from analyzing impacts toward actively shaping the co-evolution of technical capabilities with organizational routines, societal values, and regulatory institutions: emphasizing hybrid human-AI ensembles, situated validation, design principles for probabilistic systems, and adaptive governance. For practitioners and policymakers, responsible adoption requires balancing automation with human augmentation alongside transparent governance and adaptive regulations to ensure broadly shared benefits.

cs.CY

Greedy Algorithms for Decision Trees with Hypotheses

We investigate at decision trees that incorporate both traditional queries based on one attribute and queries based on hypotheses about the values of all attributes. Such decision trees are similar to ones studied in exact learning, where membership and equivalence queries are allowed. We present greedy algorithms based on diverse uncertainty measures for construction of above decision trees and discuss results of computer experiments on various data sets from the UCI ML Repository and randomly generated Boolean functions. We also study the length and coverage of decision rules derived from the decisiontrees constructed by greedy algorithms.

cs.CC

Decision Trees with Hypotheses for Recognition of Monotone Boolean Functions and for Sorting

In this paper, we consider decision trees that use both queries based on one attribute each and queries based on hypotheses about values of all attributes. Such decision trees are similar to ones studied in exact learning, where not only membership but also equivalence queries are allowed. We investigate the problem of recognition of monotone Boolean functions with $n$ variables, $n=2, \ldots, 4$, and the problem of sorting $n$ pairwise different elements from linearly ordered set, $n=3, \ldots, 6$. For each of these problems, we compare the complexity of different types of optimal (relative to the depth or the number of realizable nodes) decision trees with hypotheses. We also study the complexity of decision trees constructed by entropy-based greedy algorithm and analyze the length of decision rules derived from these trees.

cs.CC