Search results
Jump to navigation
Jump to search
Page title matches
- ...ig Data (band)|the practice of buying and selling of personal and consumer data|Surveillance capitalism}} .... Data with many entries (rows) offer greater [[statistical power]], while data with higher complexity (more attributes or columns) may lead to a higher [[ ...160 KB (20,974 words) - 20:46, 18 February 2025
- {{Short description|Origins and events of data}} ...t causes.<ref>{{Cite news|url=https://www.trifacta.com/data-lineage/|title=Data Lineage Helps Drives Business Value - Trifacta|last=Hoang|first=Natalie|dat ...42 KB (6,407 words) - 21:32, 18 January 2025
- {{Short description|Organized raw data that has not been otherwise processed or transformed}} ...ta analysis|analyzing]] the data. There are two major types of grouping: [[data binning]] of a single-dimensional variable, replacing individual numbers by ...6 KB (766 words) - 00:01, 6 October 2023
- {{Short description|Data analysis technique}} ...chieved by training models on several slightly-modified copies of existing data. ...15 KB (2,008 words) - 19:32, 6 January 2025
- {{Short description|Statistical data type}} {{distinguish|Ordinal data (programming)}} ...20 KB (3,012 words) - 10:32, 18 December 2024
- [[File:123Net Data Center (DC2).jpg|325px|thumb|alt=Narrow passageway between banks of compute A '''green data center''', or [[sustainability|sustainable]] [[data center]], is a [[service (economics)|service]] facility which utilizes [[Ef ...16 KB (2,176 words) - 23:51, 3 November 2024
- ...the re-identifiability of high-dimensional [[Data anonymization|anonymous data]]. First introduced in 2013,<ref name="uinc">{{cite journal ...the number of points ''p'' needed to uniquely identify an individual in a data set. The fewer points needed, the more unique the traces are and the easier ...6 KB (797 words) - 12:57, 9 February 2025
- ...is generally challenging. TDA provides a general framework to analyze such data in a manner that is insensitive to the particular [[metric (mathematics)|me ...[point cloud]] data. Persistent homology has been applied to many types of data across many fields. Moreover, its mathematical foundation is also of theore ...86 KB (12,084 words) - 09:32, 31 January 2025
- [[Image:TDCfullview.jpg|thumb|right|U.S. Navy Mk III Torpedo Data Computer, the standard US Navy torpedo fire control computer during World W The '''Torpedo Data Computer''' ('''TDC''') was an early [[electromechanical]] [[analog compute ...30 KB (4,470 words) - 23:36, 6 February 2025
- ...es=432–441 |last1=Beaudry |first1=Normand |title=An intuitive proof of the data processing inequality |date=2012 |doi=10.26421/QIC12.5-6-4 |arxiv=1107.0740 ...s the [[conditional mutual information]], <math>I(X;Z\mid Y)=0</math>. The data processing inequality then follows from the non-negativity of <math>I(X;Y\m ...3 KB (409 words) - 17:21, 22 August 2024
- ...ries|time]] and [[Cross-sectional study|cross-sections]]). An example is a data set containing forecasts of one or multiple macroeconomic variables produce ==Analysis of multidimensional panel data== ...3 KB (434 words) - 15:50, 9 December 2016
- {{about|a data structure|retrieving information from texts|Information retrieval}} ...e="w">{{cite thesis| type=PhD | title=Random hypergraphs for hashing-based data structures.|first1=Walzer|last1=Stefan|year=2020|pages=27–30|url=https://ww ...10 KB (1,571 words) - 15:40, 29 July 2024
- '''Surrogate data testing'''<ref name=Theiler1> ...er |title=Testing for nonlinearity in time series: the method of surrogate data ...12 KB (1,588 words) - 02:35, 29 August 2024
- ...f a sample is a distribution. One of the main challenges in distributional data analysis is that although the space of probability distributions is a conve [[Modes of variation]] are useful concepts in depicting the variation of data around the mean function. Based on the [[Kosambi-Karhunen-Loève theorem|Kar ...25 KB (4,044 words) - 09:44, 18 December 2024
- {{Short description|Data structures used to track continuously moving geometric bodies}} ...ref name="JBasch">{{Cite thesis |last1=Basch |first1=Julien |title=Kinetic Data Structures |publisher=Stanford University |url=http://www.basch.org/phdthes ...8 KB (1,207 words) - 23:54, 19 May 2023
- ...esponsive]], [[kinetic data structure#Performance#|compact]] and [[Kinetic data structure#Performance|efficient]]. ...pdated. The upper and lower envelopes can be maintained using the standard data structure for [[kinetic convex hull]]. The maximum distance between pairs o ...5 KB (730 words) - 01:39, 27 December 2024
- ...res that are secure against attacks that could reveal their access history|data structures that are I/O efficient for arbitrary cache sizes|cache-oblivious In [[computer science]], an '''oblivious data structure''' is a data structure that gives no information about the sequence or pattern of the op ...9 KB (1,410 words) - 13:13, 29 July 2024
- {{Short description|Chemical data page}} This page provides supplementary chemical data on [[Chlorobenzene]]. <!-- remove nowiki tags and replace with proper wikil ...6 KB (940 words) - 00:28, 26 October 2023
- {{short description|Method of analyzing large data sets}} ...'-way array, and analysis techniques can reveal patterns in the underlying data undetected by other methods.<ref name=Coppi1989> ...7 KB (963 words) - 11:23, 26 October 2023
- ...t of memory and time. <!-- in contrary to the traditional clustering where data are static. --> ...| last3 = Rajagopalan | citeseerx = 10.1.1.19.9554 | title = Computing on Data Streams | journal = Digital Equipment Corporation | volume = TR-1998-011 | ...10 KB (1,407 words) - 07:10, 23 October 2023
Page text matches
- The formula for a given N-Day ''period'' and for a given ''data'' series is:<ref name="formula_chart">[http://user42.tuxfamily.org/chart/ma \textit{EmaData} &= \textit{Data}+(\textit{Data} - \textit{Data}(\text{Lag days ago})) \\ ...2 KB (228 words) - 02:29, 13 June 2024
- {{Short description|Kinetic data structure}} ...tic predecessor data structure, and as a component in more complex kinetic data structures such as [[kinetic closest pair]]. ...3 KB (546 words) - 12:36, 18 August 2023
- A '''kinetic smallest enclosing disk''' data structure is a [[kinetic data structure]] that maintains the [[Smallest circle problem|smallest enclosing ...he point set as its diameter. Thus, by maintaining the [[Kinetic diameter (data)|kinetic diameter]] of the point set, the farthest-point delaunay triangula ...3 KB (475 words) - 00:29, 19 October 2015
- ...ency]] exceeds a user-given threshold. The algorithm works by dividing the data stream into buckets for frequent items, but fill as many buckets as possibl ...here data takes the form of a continuous data stream instead of a finite [[data set]], such as [[network traffic measurement]]s, [[web server]] logs, and [ ...2 KB (299 words) - 04:52, 3 March 2023
- {{Short description|Kinetic data structure}} ...sed as a basis for a responsive, compact and efficient kinetic minimum box data structure. ...3 KB (483 words) - 16:39, 25 April 2023
- {{Infobox data structure | type = [[Heap (data structure)|Heap]]/[[priority queue]] ...2 KB (317 words) - 18:49, 7 November 2024
- Key-independent optimality is a property of some [[binary search tree ]] data structures in [[computer science]] Suppose that [[Attribute–value pair|key-value pairs]] are stored in a data ...2 KB (329 words) - 13:53, 30 September 2019
- ...ries|time]] and [[Cross-sectional study|cross-sections]]). An example is a data set containing forecasts of one or multiple macroeconomic variables produce ==Analysis of multidimensional panel data== ...3 KB (434 words) - 15:50, 9 December 2016
- ...esponsive]], [[kinetic data structure#Performance#|compact]] and [[Kinetic data structure#Performance|efficient]]. ...pdated. The upper and lower envelopes can be maintained using the standard data structure for [[kinetic convex hull]]. The maximum distance between pairs o ...5 KB (730 words) - 01:39, 27 December 2024
- {{Short description|Data structure}} ...ete'' and ''find-max''. They are often used as components of other kinetic data structures, such as [[kinetic closest pair]]. ...4 KB (616 words) - 19:00, 3 January 2023
- ...ose. This method is based on the hypothesis that each item of the recorded data of a population is consistent.<ref>Searcy, J.K. and C.H. Hardison (1960). D ...ic technique|technique]] is based on the principle that when each recorded data comes from the same [[parent population]], they are consistent. ...4 KB (551 words) - 06:40, 25 September 2022
- ...tree accumulation''' is the process of accumulating data placed in [[Tree (data structure)|tree]] nodes according to their [[Tree (data structure)|tree]] structure.<ref>{{cite thesis |type=Ph.D. |first=Jeremy |l ...2 KB (220 words) - 02:35, 16 July 2018
- ...responsive]], [[Kinetic data structure#Performance|compact]] and [[Kinetic data structure#Performance|efficient]]. ...iately. The upper and lower envelopes can be maintained using the standard data structure for [[kinetic convex hull]]. The minimum distance between edge-po ...5 KB (767 words) - 07:27, 23 May 2021
- {{Short description|Type of data visualization}} ...rews curve for Iris data set.png|thumb|360px|An Andrews curve for the Iris data set]] ...3 KB (458 words) - 08:26, 22 January 2025
- {{Short description|Kinetic data structure}} A '''kinetic minimum spanning tree''' is a [[kinetic data structure]] that maintains the [[minimum spanning tree]] (MST) of a graph w ...3 KB (423 words) - 07:43, 29 April 2024
- {{Short description|Smoothing of data points, digital filter}} ...e purpose of smoothing the data, that is, to increase the precision of the data without distorting the signal tendency. ...2 KB (281 words) - 16:31, 26 February 2025
- A '''kinetic Euclidean minimum spanning tree''' is a [[kinetic data structure]] that maintains the [[Euclidean minimum spanning tree]] (EMST) o ...the EMST in [[Polylogarithmic time|polylog time]] per event. Their kinetic data structure handles <math>O(n*m)</math> events, where m is the number of all ...2 KB (260 words) - 01:37, 23 July 2023
- {{short description|Graph data structure}} ...ath> array of lists.<ref>{{Cite book|title=Statistical analysis of network data : methods and models|url=https://archive.org/details/statisticalanaly00kola ...2 KB (266 words) - 17:46, 8 January 2021
- |data-sort-value="0" | [[Avenue A (Manhattan)|Avenue A]] || All... |data-sort-value="-1" | [[Avenue B (Manhattan)|Avenue B]] || All... ...9 KB (854 words) - 14:37, 1 August 2024
- '''Address-Event Representation''' (AER) is an abstract data format used to describe discrete events using coordinates in space-time. AER is useful when working with sparse temporal data where most entries are zeros and can be ignored, and is closely related to ...2 KB (227 words) - 23:27, 23 January 2025