Multiple Removal in the Inverse Data Space

Author(s):  
D. J. Verschuur ◽  
A. J. Berkhout
Keyword(s):  
Author(s):  
Michael Goul ◽  
T. S. Raghu ◽  
Ziru Li

As procurement organizations increasingly move from a cost-and-efficiency emphasis to a profit-and-growth emphasis, flexible data architecture will become an integral part of a procurement analytics strategy. It is therefore imperative for procurement leaders to understand and address digitization trends in supply chains and to develop strategies to create robust data architecture and analytics strategies for the future. This chapter assesses and examines the ways companies can organize their procurement data architectures in the big data space to mitigate current limitations and to lay foundations for the discovery of new insights. It sets out to understand and define the levels of maturity in procurement organizations as they pertain to the capture, curation, exploitation, and management of procurement data. The chapter then develops a framework for articulating the value proposition of moving between maturity levels and examines what the future entails for companies with mature data architectures. In addition to surveying the practitioner and academic research literature on procurement data analytics, the chapter presents detailed and structured interviews with over fifteen procurement experts from companies around the globe. The chapter finds several important and useful strategies that have helped procurement organizations design strategic roadmaps for the development of robust data architectures. It then further identifies four archetype procurement area data architecture contexts. In addition, this chapter details exemplary high-level mature data architecture for each archetype and examines the critical assumptions underlying each one. Data architectures built for the future need a design approach that supports both descriptive and real-time, prescriptive analytics.


2009 ◽  
Vol 41 (1) ◽  
pp. 499-503 ◽  
Author(s):  
Amruth N. Kumar
Keyword(s):  

2021 ◽  
Vol 10 (4) ◽  
pp. 246
Author(s):  
Vagan Terziyan ◽  
Anton Nikulin

Operating with ignorance is an important concern of geographical information science when the objective is to discover knowledge from the imperfect spatial data. Data mining (driven by knowledge discovery tools) is about processing available (observed, known, and understood) samples of data aiming to build a model (e.g., a classifier) to handle data samples that are not yet observed, known, or understood. These tools traditionally take semantically labeled samples of the available data (known facts) as an input for learning. We want to challenge the indispensability of this approach, and we suggest considering the things the other way around. What if the task would be as follows: how to build a model based on the semantics of our ignorance, i.e., by processing the shape of “voids” within the available data space? Can we improve traditional classification by also modeling the ignorance? In this paper, we provide some algorithms for the discovery and visualization of the ignorance zones in two-dimensional data spaces and design two ignorance-aware smart prototype selection techniques (incremental and adversarial) to improve the performance of the nearest neighbor classifiers. We present experiments with artificial and real datasets to test the concept of the usefulness of ignorance semantics discovery.


2012 ◽  
Author(s):  
Kun Wang ◽  
Richard Su ◽  
Alexander A. Oraevsky ◽  
Mark A. Anastasio

Author(s):  
Zuo Dai ◽  
Jianzhong Cha

Abstract In simulating the three dimensional packing process with arbitrary shaped objects, the task of detecting interference between objects is important and very difficult. This paper, representing the three dimensional packing space and objects with an octree, presents an effective interference detection algorithm, which can overcome the performance shortcomings that the conventional methods have in terms of real-time response, computer memory and computational accuracy. By recording the distribution status of packing space in the “bits” of short integers, the data space can be compressed to 1/16 of that used by conventional algorithms.


Sign in / Sign up

Export Citation Format

Share Document