New pages
From IT Wiki
- 14:31, 4 November 2024 Collaborative Filtering (hist | edit) [3,798 bytes] 핵톤 (talk | contribs) (Created page with "Collaborative Filtering is a popular technique in recommender systems that predicts a user’s interest by identifying patterns from the behavior and preferences of similar users or items. It relies on the assumption that if users have agreed on past items, they are likely to agree on similar items in the future. ==Types of Collaborative Filtering== Collaborative Filtering can be divided into two main approaches: *'''User-Based Collaborative Filtering''': Recommends item...") Tag: Visual edit
- 14:29, 4 November 2024 Recommender System (hist | edit) [3,866 bytes] 핵톤 (talk | contribs) (Created page with "A Recommender System is a data-driven algorithm designed to suggest relevant items or content to users based on their preferences, behavior, or similar users’ choices. It is widely used in e-commerce, streaming services, social media, and other online platforms to enhance user experience by delivering personalized recommendations. ==Types of Recommender Systems== There are several main types of recommender systems, each with different approaches to making recommendatio...") Tag: Visual edit
- 14:26, 4 November 2024 Precision-Recall Curve (hist | edit) [3,840 bytes] 핵톤 (talk | contribs) (Created page with "The Precision-Recall Curve is a graphical representation used in binary classification to evaluate a model's performance, especially in imbalanced datasets. It plots precision (y-axis) against recall (x-axis) at various threshold settings, showing the trade-off between the two metrics as the decision threshold changes. ==What is a Precision-Recall Curve?== A Precision-Recall Curve shows how well a model balances precision (the accuracy of positive predictions) and recall...") Tag: Visual edit
- 14:19, 4 November 2024 Gain Chart (hist | edit) [3,862 bytes] 핵톤 (talk | contribs) (Created page with "A Gain Chart, or Cumulative Gain Chart, is a graphical tool used to evaluate the effectiveness of a predictive model by showing the cumulative percentage of positive outcomes identified as more of the dataset is included. It helps assess how well the model ranks positive cases, particularly in applications where targeting high-value instances is essential. ==What is a Gain Chart?== A Gain Chart plots the cumulative percentage of positive outcomes (y-axis) against the cum...") Tag: Visual edit
- 14:19, 4 November 2024 Cumulative Response Curve (hist | edit) [3,296 bytes] 핵톤 (talk | contribs) (Created page with "'''Cumulative Response Curve (CRC)''' is graphical tools used in predictive modeling and data science to assess a model's ability to capture positive outcomes as more of the dataset is selected. They provide insight into how effectively a model identifies the highest value cases early in the ranking. ==What is a Cumulative Response Curve?== A Cumulative Response Curve plots the cumulative percentage of actual positive instances (y-axis) against the cumulative percentage...") Tag: Visual edit
- 14:18, 4 November 2024 Lift Curve (hist | edit) [3,328 bytes] 핵톤 (talk | contribs) (Created page with "A '''Lift Curve''' is a graphical representation used in predictive modeling to measure the effectiveness of a model in identifying positive outcomes, compared to a baseline of random selection. It shows how much more likely the model is to capture positive cases within selected segments compared to a random approach. ==What is a Lift Curve?== A Lift Curve plots the lift (y-axis) against the cumulative percentage of the dataset selected (x-axis). It illustrates how well...") Tag: Visual edit
- 14:16, 4 November 2024 Gain (Data Science) (hist | edit) [3,713 bytes] 핵톤 (talk | contribs) (Created page with "'''Gain''' is a metric used in data science, marketing, and predictive modeling to measure the cumulative success of a model in capturing positive outcomes as more of the dataset is utilized. It provides insight into how effectively a model ranks and selects positive cases, particularly in applications where maximizing the return on targeted resources is essential. ==What is Gain?== Gain quantifies the cumulative proportion of positive outcomes identified by the model as...") Tag: Visual edit
- 14:15, 4 November 2024 Lift (Data Science) (hist | edit) [3,303 bytes] 핵톤 (talk | contribs) (Created page with "'''Lift''' is a metric used in marketing, sales, and data science to measure the effectiveness of a predictive model, especially in identifying positive outcomes such as likely buyers or high-risk customers. It quantifies how much better a model performs in comparison to random chance. ==Understanding Lift== Lift evaluates the concentration of positive instances (e.g., buyers, responders) within a selected group compared to the overall rate of positives in the entire pop...") Tag: Visual edit
- 14:12, 4 November 2024 Data Science Cheat Sheet (hist | edit) [6,117 bytes] 핵톤 (talk | contribs) (Created page with "== Confusion Matrix and F1 Score == '''Confusion Matrix''' {| class="wikitable" |- ! !!Predicted Positive!!Predicted Negative |- |'''Actual Positive'''||True Positive (TP)||False Negative (FN) |- |'''Actual Negative'''||False Positive (FP)||True Negative (TN) |} '''F1 Score''' = 2 * (Precision * Recall) / (Precision + Recall) * 2 * (Positive Predictive Value * True Positive Rate) / (Positive Predictive Value + True Positive Rate) * 2 * (TP) / (TP + FP + FN) ==...") Tag: Visual edit
- 14:11, 4 November 2024 Specificity (Data Science) (hist | edit) [2,246 bytes] 핵톤 (talk | contribs) (Created page with "'''Specificity''', also known as the '''True Negative Rate (TNR)''', is a metric used in binary classification to measure the proportion of actual negative cases that are correctly identified by the model. It reflects the model’s ability to avoid false positives and accurately classify negative instances. ==Definition== Specificity is calculated as: :'''<big>Specificity = True Negatives / (True Negatives + False Positives)</big>''' A higher specificity value indicates...") Tag: Visual edit
- 13:57, 4 November 2024 False Positive Rate (hist | edit) [2,077 bytes] 핵톤 (talk | contribs) (Created page with "The '''False Positive Rate (FPR)''' is a metric used in binary classification to measure the proportion of actual negatives that are incorrectly identified as positives by the model. It is an important metric for understanding the model's tendency to produce false alarms. ==Definition== The False Positive Rate is calculated as: :'''FPR = False Positives / (False Positives + True Negatives)''' This metric represents the likelihood of a negative instance being misclassifie...") Tag: Visual edit
- 12:15, 4 November 2024 Area Under the Curve (hist | edit) [2,354 bytes] 핵톤 (talk | contribs) (Created page with "The Area Under the Curve (AUC) is a metric used in classification tasks to evaluate the overall performance of a binary classification model. It represents the area under the ROC (Receiver Operating Characteristic) Curve, providing a single value that summarizes the model’s ability to distinguish between positive and negative classes across all thresholds. ==Definition== AUC values range from 0 to 1: *'''AUC = 1''': Indicates a perfect classifier that co...") Tag: Visual edit
- 12:13, 4 November 2024 ROC Curve (hist | edit) [2,501 bytes] 핵톤 (talk | contribs) (Created page with "The '''ROC (Receiver Operating Characteristic) Curve''' is a graphical representation used to evaluate the performance of a binary classification model. It plots the true positive rate (sensitivity) against the false positive rate (1 - specificity) at various threshold settings, providing insight into the trade-offs between sensitivity and specificity. ==Definition== The ROC Curve is created by plotting: *'''True Positive Rate (TPR)''' or Sensitivity: TPR = True Positive...") Tag: Visual edit
- 12:05, 4 November 2024 Classification Metrics (hist | edit) [3,024 bytes] 핵톤 (talk | contribs) (Created page with "'''Classification metrics''' are evaluation measures used to assess the performance of classification models in machine learning and data science. These metrics help determine how well a model can predict the correct class labels, particularly in supervised learning tasks. ==Common Classification Metrics== There are several widely used classification metrics, each serving different aspects of model performance: *'''Accuracy''': Measures the ratio of correct predictions t...") Tag: Visual edit
- 12:03, 4 November 2024 Confusion Matrix (hist | edit) [2,343 bytes] 핵톤 (talk | contribs) (Created page with "'''Confusion Matrix''' is a tool used in data science and machine learning to evaluate the performance of a classification model. It provides a tabular summary of the model's predictions against the actual values, breaking down the number of correct and incorrect predictions for each class. ==Structure== The confusion matrix is typically a 2x2 table for binary classification, with the following layout: *'''True Positives (TP)''': Correctly predicted positive instances *...") Tag: Visual edit
- 11:59, 4 November 2024 Recall (Data Science) (hist | edit) [2,267 bytes] 핵톤 (talk | contribs) (Created page with "'''Recall''' is a metric used in data science, particularly in classification problems, to measure the completeness of positive predictions. It represents the ratio of true positive predictions to the sum of true positives and false negatives, reflecting the model's ability to identify all relevant instances within the data. ==Definition== Recall is calculated as: :'''Recall = True Positives / (True Positives + False Negatives)''' This metric is crucial when the focus is...") Tag: Visual edit
- 11:58, 4 November 2024 Precision (Data Science) (hist | edit) [2,396 bytes] 핵톤 (talk | contribs) (Created page with "'''Precision''' is a metric used in data science, particularly in classification problems, to measure the accuracy of positive predictions. It is defined as the ratio of true positive predictions to the sum of true positive and false positive predictions, offering insights into the model's performance in correctly identifying positive instances. ==Definition== Precision is calculated as: :'''<big>Precision = True Positives / (True Positives + False Positives)</big>''' Th...") Tag: Visual edit
- 11:55, 4 November 2024 Accuracy (Data Science) (hist | edit) [2,174 bytes] 핵톤 (talk | contribs) (Created page with "Accuracy is a metric used in data science to measure the performance of a model, particularly in classification problems. It represents the ratio of correctly predicted instances to the total number of instances. ==Definition== Accuracy is calculated as: :'''<big>Accuracy = (True Positives + True Negatives) / (Total Number of Instances)</big>''' This metric is often used in classification problems, where the goal is to determine how well a model can predict class labels....") Tag: Visual edit
- 11:51, 4 November 2024 Gini Impurity (Data Science) (hist | edit) [2,355 bytes] 핵톤 (talk | contribs) (Created page with "'''Gini Impurity''' is a metric used in data science, particularly in decision tree algorithms, to measure the "impurity" or diversity of a dataset. It helps in determining how well a split at a node separates the data into distinct classes, making it essential for classification problems. ==Definition== Gini impurity calculates the probability that a randomly chosen element from a dataset will be incorrectly classified if it is randomly labeled accordi...") Tag: Visual edit
- 11:46, 4 November 2024 Entropy (Data Science) (hist | edit) [5,845 bytes] 핵톤 (talk | contribs) (Created page with "'''Entropy (Data Science)''' In '''Data Science''', '''Entropy''' is a measure of randomness or uncertainty in a dataset. Often used in Decision Trees and other machine learning algorithms, entropy quantifies the impurity or unpredictability of information in a set of data. In classification tasks, entropy helps determine the best way to split data to reduce uncertainty and increase homogeneity in the resulting subsets. ==How Entropy Works== Entropy, denoted as H, is ca...") Tag: Visual edit
- 11:43, 4 November 2024 Decision Tree (hist | edit) [3,463 bytes] 핵톤 (talk | contribs) (Created page with "'''Decision Tree''' A '''Decision Tree''' is a supervised learning algorithm used for both classification and regression tasks. It structures decisions as a tree-like model, where each internal node represents a test on a feature, each branch represents an outcome of that test, and each leaf node represents a class label or prediction. Decision Trees are highly interpretable and can work with both categorical and numerical data, making them widely applicable across vari...") Tag: Visual edit
- 11:39, 4 November 2024 Random Forest (hist | edit) [3,898 bytes] 핵톤 (talk | contribs) (Created page with "'''Random Forest''' is an ensemble learning method that combines multiple Decision Trees to improve classification or regression accuracy. It is designed to mitigate the limitations of single Decision Trees, such as overfitting and sensitivity to data variations, by building a "forest" of trees and aggregating their predictions. This approach often leads to greater model stability and accuracy. ==How It Works== Random Forest creates multiple Decision Trees during trainin...") Tag: Visual edit
- 11:33, 4 November 2024 Logistic Regression (hist | edit) [3,911 bytes] 핵톤 (talk | contribs) (Created page with "'''Logistic regression''' is a statistical and machine learning algorithm used for binary classification tasks, where the output variable is categorical and typically represents two classes (e.g., yes/no, spam/not spam, fraud/not fraud). Despite its name, Logistic Regression is a classification algorithm, not a regression algorithm, as it predicts probabilities of classes rather than continuous values. ==How It Works== Logistic Regression models the probability of a bin...") Tag: Visual edit
- 11:29, 4 November 2024 Support Vector Machine (hist | edit) [4,232 bytes] 핵톤 (talk | contribs) (Created page with "'''Support Vector Machine (SVM)''' is a powerful supervised machine learning algorithm used for both classification and regression tasks, though it is primarily used in classification. SVM works by finding the optimal boundary, or hyperplane, that best separates the data points of different classes. SVM is effective in high-dimensional spaces and is especially suitable for binary classification problems. ==How It Works== SVM aims to maximize the margin between data point...") Tag: Visual edit
- 11:18, 4 November 2024 Independence (Linear Regression) (hist | edit) [2,421 bytes] 핵톤 (talk | contribs) (Created page with "In the context of '''Linear Regression''', '''independence''' refers to the assumption that each observation in the dataset is independent of the others. This assumption is crucial for producing unbiased estimates and valid predictions. When observations are independent, it implies that the value of one observation does not influence or provide information about another observation. ==Importance of the Independence Assumption== Independence is a foundational assumption f...") Tag: Visual edit
- 11:15, 4 November 2024 Linear Regression (hist | edit) [3,427 bytes] 핵톤 (talk | contribs) (Created page with "'''Linear Regression''' is a fundamental regression algorithm used in machine learning and statistics to model the relationship between a dependent variable and one or more independent variables. It assumes a linear relationship between the variables, which means the change in the dependent variable is proportional to the change in the independent variables. Linear Regression is commonly used for predictive analysis and trend forecasting. ==Types of Linear Regression== T...") Tag: Visual edit
- 11:08, 4 November 2024 Discrete (hist | edit) [2,011 bytes] 핵톤 (talk | contribs) (Created page with "In mathematics and computer science, '''discrete''' refers to distinct, separate values or entities, as opposed to continuous values. Discrete data or structures consist of isolated points or categories, often represented by integers or categorical labels. In contrast, continuous data have values that fall within a range and can take on any value within that interval. ==Examples of Discrete Data== Discrete data is commonly found in many fields and applications: *'''Count...") Tag: Visual edit
- 11:05, 4 November 2024 Classification Algorithm (hist | edit) [4,578 bytes] 핵톤 (talk | contribs) (Created page with "'''Classification algorithms''' are a group of machine learning methods used to categorize data into discrete classes or labels. These algorithms learn from labeled data during training and make predictions by assigning an input to one of several possible categories. Classification is widely applied in areas like image recognition, spam filtering, and medical diagnosis. ==Types of Classification Algorithms== There are various types of classification algorithms, each with...") Tag: Visual edit
- 11:00, 4 November 2024 Regression Algorithm (hist | edit) [4,309 bytes] 핵톤 (talk | contribs) (Created page with "'''Regression algorithms''' are a family of machine learning methods used for predicting continuous numerical values based on input features. Unlike classification, which predicts discrete classes, regression predicts outputs that can take any real number value. Regression algorithms are widely used in various fields, such as finance, economics, and environmental science, where predicting quantities (like stock prices, sales, or temperatures) is essential. ==Types of Reg...") Tag: Visual edit
- 10:57, 4 November 2024 K-Nearest Neighbor (hist | edit) [3,441 bytes] 핵톤 (talk | contribs) (Created page with "'''K-Nearest Neighbo'''r, often abbreviated as '''K-NN''', is a simple and intuitive classification and regression algorithm used in supervised machine learning. It classifies new data points based on the majority class among its nearest neighbors in the feature space. K-NN is a non-parametric algorithm, meaning it makes no assumptions about the underlying data distribution, making it v...") Tag: Visual edit
- 10:46, 4 November 2024 Data Science (hist | edit) [3,661 bytes] 핵톤 (talk | contribs) (Created page with "Data Science is an interdisciplinary field that uses scientific methods, algorithms, and systems to extract knowledge and insights from both structured and unstructured data. It combines elements of statistics, computer science, and domain expertise to analyze complex data and derive actionable conclusions. The goal of Data Science is often to make data-driven decisions, predict trends, and provide meaningful insights that can guide business and research. ==Key Component...") Tag: Visual edit
- 10:44, 4 November 2024 Bayes' Theorem (hist | edit) [1,003 bytes] 핵톤 (talk | contribs) (Created page with "'''Bayes' theorem''' is a fundamental principle in probability theory and statistics, which describes how to update the probability of a hypothesis based on new evidence. It provides a mathematical framework for reasoning under uncertainty and is often used in machine learning, especially in algorithms like Naive Bayes. The theorem is expressed as: P(A | B) = (P(B | A) * P(A)) / P(B) where: *'''P(A | B)''' is the posterior probability: the probability of event A occur...") Tag: Visual edit
- 10:38, 4 November 2024 Naive Bayes (hist | edit) [2,165 bytes] 핵톤 (talk | contribs) (Created page with "**Naive Bayes** The '''Naive Bayes''' algorithm is a probability-based classification method that calculates the likelihood of data belonging to a specific class by using conditional probabilities. As suggested by the term "naive," this algorithm assumes that each feature is independent of the others. While this assumption is often unrealistic, Naive Bayes proves to be practical and efficient in classification tasks, providing good performance on real-world data. Naive...")
- 00:18, 3 November 2024 Main Page (hist | edit) [836 bytes] Itwiki (talk | contribs) (Created page with "This wiki is primarily in Korean and intended for Korean users. Some documents are available in English. If you search in English and are redirected to a Korean page, it means that the document is only available in Korean. However, users from English-speaking countries are also welcome to contribute freely to this wiki.") Tag: Visual edit
- 00:16, 3 November 2024 Model Interpretability (hist | edit) [2,575 bytes] 핵톤 (talk | contribs) (새 문서: '''Model interpretability''' is the ability to understand or explain how a model performs predictions. It indicates whether a model’s decisions can be explained to humans and how well the reasoning behind them can be communicated. == Interpretability by Model Type == The following list generally starts with models that are considered to have higher interpretability. === Linear Regression === * A simple mathematical model that assigns linear coefficients to each feature,...) Tag: Visual edit
- 00:05, 3 November 2024 모델 해석 가능성 (hist | edit) [2,903 bytes] 핵톤 (talk | contribs) (새 문서: Model Interpretability 모델 해석 가능성은 인공지능이나 기계 학습 모델이 예측을 어떻게 수행하는지 이해하거나 설명할 수 있는 능력을 의미한다. 이는 모델이 내리는 결정을 사람에게 설명할 수 있는지, 또 그 이유를 얼마나 잘 전달할 수 있는지를 나타낸. == 모델별 해석 가능성 == 아래 목록은 일반적으로 해석 가능성이 높은 모델을 우선적으로 작성한 내용이다....)
- 06:10, 2 November 2024 CRUD (hist | edit) [1,839 bytes] 핵톤 (talk | contribs) (새 문서: CRUD는 '''Create, Read, Update, Delete'''의 약자로, 데이터베이스 관리 및 애플리케이션 개발에서 필수적인 네 가지 기본 작업을 의미한다. == 구성 == # '''Create (생성)''': 데이터베이스에 새로운 데이터를 추가하는 작업이다. #* 예를 들어, 사용자 계정 생성, 주문 등록, 제품 추가 등이 포함될 수 있다. # '''Read (읽기)''': 기존 데이터를 조회하거나 보는 작업이다. #* 예를 들...) Tag: Visual edit
- 01:25, 31 October 2024 의대 계약정원제 (hist | edit) [4,446 bytes] 172.70.114.223 (talk) (새 문서: 의대 계약정원제는 지방 의대생 일부를 지역 공공병원에서 일정 기간 이상 의무적으로 근무하는 조건으로 선발하도록 하는 제도이다. == 취지 == 이는 지방 의료 인력의 수도권 유출을 막고 의료 공백을 해소할 수 있다. 현재 의사들이 지방에선 거의 근무하지 않으려고 하기 때문에 지방의 필수 의료 인력 부족으로 주민들(주로 노령층)이 아파도 치료를 받지 못하...) Tag: Visual edit
- 07:00, 29 October 2024 나이브 베이즈 (hist | edit) [2,556 bytes] 핵톤 (talk | contribs) (새 문서: Naive Bayes '''나이브 베이즈'''는 확률에 기반한 분류 알고리즘으로, 조건부 확률을 활용하여 데이터가 특정 클래스에 속할 확률을 계산한다. 이 알고리즘은 '나이브(naive)'라는 이름에서 알 수 있듯이, 각 독립 변수가 서로 독립적이라는 가정을 한다. 이러한 가정은 현실에서는 성립하지 않는 경우가 많지만, 나이브 베이즈는 실제 데이터에서 실용적이고 빠른 분류...) Tag: Visual edit
- 05:30, 29 October 2024 캘리브레이션 플롯 (hist | edit) [1,227 bytes] 핵톤 (talk | contribs) (새 문서: '''Calibration plot''' 캘리브레이션 플롯은 머신 러닝 등의 예측 모델에서 예측 확률이 실제 결과와 얼마나 잘 일치하는지를 평가하기 위해 사용되는 도구이다. 특히 '''확률적 예측 모델'''에서 유용하며, 분류 모델의 신뢰도를 평가하는 데 자주 활용된다. == Calibration Plot의 구성 == * '''X축''': 모델의 예측 확률 (예: 0.0에서 1.0 사이의 값) * '''Y축''': 실제 관찰된 빈도(또...) Tag: Visual edit
- 02:32, 25 October 2024 포워드 DNS (hist | edit) [7,049 bytes] 파네라 (talk | contribs) (새 문서: '''Forward DNS''' '''포워드 DNS'''는 도메인 이름을 '''IP 주소로 변환'''하는 과정을 의미한다. 즉, 사용자가 웹 브라우저에서 도메인 이름(예: www.example.com)을 입력하면, 포워드 DNS 조회를 통해 해당 도메인의 IP 주소를 찾아내는 방식이다. DNS 리졸버를 이용하는 과정이라고 할 수 있다. '''포워드 DNS의 예시''' * 사용자가 www.example.com에 접속하려고 할 때, 포워드 DNS 조회...) Tag: Visual edit
- 01:58, 25 October 2024 DNS 리졸버 (hist | edit) [3,434 bytes] 파네라 (talk | contribs) (새 문서: '''DNS Resolver''' '''DNS 리졸버'''는 사용자가 도메인 이름을 입력하면 해당 도메인에 대한 '''IP 주소'''를 찾아주는 클라이언트 측 구성 요소이다. DNS 리졸버는 '''도메인 네임 시스템(DNS)'''의 중요한 부분으로, 사용자가 웹사이트에 접근할 수 있도록 도메인 이름과 IP 주소 간의 매핑을 처리한다. DNS 리졸버는 사용자와 DNS 서버 사이의 중개 역할을...) Tag: Visual edit
- 01:51, 25 October 2024 지속적 연결 (hist | edit) [5,754 bytes] 파네라 (talk | contribs) (새 문서: * '''상위 문서: HTTP''' '''Persistent Connection'''지속적 연결은 '''HTTP/1.1'''에서 도입된 기술로, 한 번 설정된 TCP 연결을 여러 요청에 걸쳐 유지하는 방식이다. 이를 통해 각 요청마다 새로운 연결을 설정하고 종료하는 과정을 반복하는 대신, '''하나의 연결을 여러 리소스 요청에 사용'''하여 효율성을 높일 수 있다. == HTTP/1.0와의 가장 큰 차이 == * '''HTTP/1.0''':...) Tag: Visual edit
- 01:13, 25 October 2024 토큰 링 (hist | edit) [1,581 bytes] 파네라 (talk | contribs) (새 문서: '''Token Ring''' 토큰링은 컴퓨터 네트워크에서 사용되는 통신 프로토콜 중 하나로, 네트워크의 모든 장치가 링(ring) 형태로 연결된 구조에서 데이터를 전송하는 방식이다. 이 프로토콜에서는 '''토큰'''이라는 특별한 데이터 패킷이 네트워크를 순환하면서 통신을 제어한다. == 주요 특징 == * '''토큰 기반 전송''': 네트워크에서 데이터를 전송하기 위해서는 해당 장치...) Tag: Visual edit
- 01:06, 25 October 2024 동기식 시분할 다중화 (hist | edit) [1,844 bytes] 파네라 (talk | contribs) (새 문서: '''Synchronous Time Division Multiplexing, STDM''' '''동기식 시분할 다중화'''는 여러 신호를 하나의 통신 채널에서 시간 단위로 나누어 전송하는 방식이다. 여기서 '동기식'이라는 의미는, 각 신호(혹은 사용자)에게 미리 정해진 고정된 시간 슬롯이 주어진다는 것이다. 이 방식에서는 모든 신호가 자신만의 시간 슬롯을 가지고, 주어진 시간에만 데이터를 전송한다. == 주요 특...) Tag: Visual edit
- 01:02, 25 October 2024 도메인 네임 시스템 (hist | edit) [1,981 bytes] 파네라 (talk | contribs) (새 문서: 분류:보안 분류:정보보안기사 분류:정보처리기사 분류:네트워크 ;Domain Name System 도메인 이름이 IP 주소로 상호 변환되는 시스템 *숫자로 이루어진 인터넷 주소를 사용자의 이해와 기억을 돕기 위해 이름과 위치 등을 나타내는 일련의 단어로 변환하는 구조 *공대위키는 115.71.236.146 이라는 주소를 가진 서버지만, 외우기 힘드므로 itwiki.kr이라는 도메인을...)
- 00:59, 25 October 2024 네임 서버 (hist | edit) [1,176 bytes] 파네라 (talk | contribs) (새 문서: '''Name Server''' 네임 서버는 '''도메인 네임 시스템(DNS)'''의 중요한 구성 요소로, 도메인 이름을 해당 IP 주소로 변환하는 역할을 한다. 인터넷 상에서 모든 기기나 서버는 IP 주소를 통해 서로 통신하지만, 사람이 숫자로 이루어진 IP 주소를 기억하기 어려워서 도메인 이름을 사용하게 된다. 네임 서버는 이러한 도메인 이름과 IP 주소 간의 매핑...) Tag: Visual edit
- 11:38, 24 October 2024 모바일 IP (hist | edit) [2,710 bytes] 파네라 (talk | contribs) (새 문서: '''모바일 IP'''는 '''IETF'''에 의해 개발된 프로토콜로, 장치가 네트워크를 이동할 때도 원래의 홈 주소(Home Address)를 유지하며 통신할 수 있도록하는 시스템이다. * 기존 IP 시스템에서는 네트워크 변경 시 새로운 IP 주소를 할당받아 기존 연결이 끊어지지만, 모바일 IP는 이를 해결하여 네트워크 이동성(Mobility)을 보장한다. 주로 무선 네트워크 환경에서 장치 이동 중에...) Tag: Visual edit
- 11:34, 24 October 2024 CoA (hist | edit) [2,273 bytes] 파네라 (talk | contribs) (새 문서: * 상위 개념: '''모바일 IP''' '''Care of Address, CoA'''<ref>한국어 표현이 별도로 없으므로, 일반적으로 불리는 영어 약어를 대표명으로 함</ref> CoA는 모바일 IP(Mobile IP)에서 사용자가 원래 네트워크를 벗어나 새로운 네트워크에 접속했을 때, 해당 네트워크에서 임시로 할당받는 IP 주소이다. 모바일 IP에서 중요한 개념으로, 이동 중인 장치가 네트워크를 변경해도 지...) Tag: Visual edit
- 10:09, 24 October 2024 왈시 코드 (hist | edit) [3,920 bytes] 파네라 (talk | contribs) (새 문서: '''Walsh Code''' 왈시 코드는 CDMA에서 사용되는 직교 코드 중 하나로, 서로 다른 사용자 간의 신호 간섭을 방지하기 위해 사용된다. CDMA 시스템에서 여러 사용자가 동시에 같은 주파수 대역을 사용할 때, 각 사용자가 고유한 직교 코드를 사용해 데이터를 인코딩하고, 이를 통해 여러 사용자가 신호 간섭 없이 데이터를 전송할 수 있다. == 특징 == '''직교성:''' * 왈시 코...) Tag: Visual edit
