메뉴 건너뛰기
.. 내서재 .. 알림
소속 기관/학교 인증
인증하면 논문, 학술자료 등을  무료로 열람할 수 있어요.
한국대학교, 누리자동차, 시립도서관 등 나의 기관을 확인해보세요
(국내 대학 90% 이상 구독 중)
로그인 회원가입 고객센터 ENG
주제분류

추천
검색

논문 기본 정보

자료유형
학술저널
저자정보
저널정보
한국정보처리학회 JIPS(Journal of Information Processing Systems) JIPS(Journal of Information Processing Systems) 제14권 제4호
발행연도
2018.1
수록면
961 - 979 (19page)

이용수

표지
📌
연구주제
📖
연구배경
🔬
연구방법
🏆
연구결과
AI에게 요청하기
추천
검색

초록· 키워드

오류제보하기
For many years, matching in a bipartite graph has been widely used in various assignment problems, such asstable marriage problem (SMP). As an application of bipartite matching, the problem of stable marriage isdefined over equally sized sets of men and women to identify a stable matching in which each person isassigned a partner of opposite gender according to their preferences. The classical SMP proposed by Gale andShapley uses preference lists for each individual (men and women) which are infeasible in real worldapplications for a large populace of men and women such as matrimonial websites. In this paper, we haveproposed an enhancement to the SMP by computing a weighted score for the users registered at matrimonialwebsites. The proposed enhancement has been formulated into profit maximization of matrimonial websitesin terms of their ability to provide a suitable match for the users. The proposed formulation to maximize theprofits of matrimonial websites leads to a combinatorial optimization problem. We have proposed greedy andgenetic algorithm based approaches to solve the proposed optimization problem. We have shown that theproposed genetic algorithm based approaches outperform the existing Gale-Shapley algorithm on the datasetcrawled from matrimonial websites.

목차

등록된 정보가 없습니다.

참고문헌 (16)

참고문헌 신청

함께 읽어보면 좋을 논문

논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!

이 논문의 저자 정보

최근 본 자료

전체보기

댓글(0)

0